Linear Programming - New Frontiers in Theory and Applications : (Record no. 61354)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 11290nam a22005173i 4500 |
001 - CONTROL NUMBER | |
control field | EBC3021711 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | MiAaPQ |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240729124153.0 |
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS | |
fixed length control field | m o d | |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
fixed length control field | cr cnu|||||||| |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 240724s2012 xx o ||||0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9781624173615 |
Qualifying information | (electronic bk.) |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
Canceled/invalid ISBN | 9781612095790 |
035 ## - SYSTEM CONTROL NUMBER | |
System control number | (MiAaPQ)EBC3021711 |
035 ## - SYSTEM CONTROL NUMBER | |
System control number | (Au-PeEL)EBL3021711 |
035 ## - SYSTEM CONTROL NUMBER | |
System control number | (CaPaEBR)ebr10683451 |
035 ## - SYSTEM CONTROL NUMBER | |
System control number | (OCoLC)834136812 |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | MiAaPQ |
Language of cataloging | eng |
Description conventions | rda |
-- | pn |
Transcribing agency | MiAaPQ |
Modifying agency | MiAaPQ |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | T57.74 -- .M36 2012eb |
082 0# - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 519.7/2 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Mann, Zoltán Ádám. |
245 10 - TITLE STATEMENT | |
Title | Linear Programming - New Frontiers in Theory and Applications : |
Remainder of title | New Frontiers in Theory and Applications. |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. |
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
Place of production, publication, distribution, manufacture | Hauppauge : |
Name of producer, publisher, distributor, manufacturer | Nova Science Publishers, Incorporated, |
Date of production, publication, distribution, manufacture, or copyright notice | 2012. |
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
Date of production, publication, distribution, manufacture, or copyright notice | ©2012. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 1 online resource (391 pages) |
336 ## - CONTENT TYPE | |
Content type term | text |
Content type code | txt |
Source | rdacontent |
337 ## - MEDIA TYPE | |
Media type term | computer |
Media type code | c |
Source | rdamedia |
338 ## - CARRIER TYPE | |
Carrier type term | online resource |
Carrier type code | cr |
Source | rdacarrier |
490 1# - SERIES STATEMENT | |
Series statement | Mathematics Research Developments |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | Intro -- LINEAR PROGRAMMINGNEW FRONTIERS INTHEORY AND APPLICATIONS -- MATHEMATICS RESEARCH DEVELOPMENTS -- LIBRARY OF CONGRESS CATALOGING-IN-PUBLICATION DATA -- CONTENTS -- PREFACE -- Linear Programming: A Multidisciplinary Success Story -- PART I. THEORY -- TWO-STAGE STOCHASTIC MIXED INTEGER LINEAR PROGRAMMING -- Abstract -- 1. Introduction -- 2. Introduction to 2S-MILP -- 3. A Novel Dynamic 2S-MILP Formulation and Solution Approaches for Multi-Period Multi-Uncertainty -- 3.1. Dynamic 2S-MILP Formulation under Multi-Period Multi-Uncertainty -- 3.2. Evolution of MPMU and Rolling Horizon Strategy / Moving Horizon Strategy -- 3.3. Static MPMU and Scenario Group Based Approach (SGA) -- 4. The Extension of EPS Logistics to 2S-MILP -- 4.1. DDEP Extension for RHS / MHS -- 4.2. DDEP-S2S Extension for SGA -- 4.2.1. The First Solution Step -- 4.2.2. The Second Solution Step -- 4.2.3. The Remaining Solution Steps -- 5. Numerical Results -- 5.1. EPS-DDEP-S2S Models on SGA -- 5.1.1. Results Based on Scenarios -- 5.1.2. Results for the First Two Periods -- 5.1.3.The Comparison between 2S-MILP and EEV -- 5.2. EPS-DDEP Models on RHS -- 5.3. EPS-DDEP Models on MHS -- 5.3.1. Multi-Period Demand Uncertainties (MPDU) -- 5.3.2. Multi-Period Multi-Uncertainty (MPMU) -- 5.3.2.1. Case 1: Multi-Period Plant Capacity and Demand Uncertainties (CDU) -- 5.3.2.2. Case 2: Multi-Period Yields, Plant Capacity and Demand Uncertainties (YCDU) -- 6. Conclusion -- Appendix A: Problem Data -- A.1. Grain Size Distributions -- A.2. Problem Data for Section 5.2 -- A.3. Problem Data for Section 5.3.1 -- A.4. Problem Data for Section 5.3.2.1 -- A.5. Problem Data for Section 5.3.2.2 -- References -- INTERVAL LINEAR PROGRAMMING: A SURVEY -- Abstract -- 1.Introduction -- 1.1.Intervalcomputing -- 1.2.Intervallinearprogramming -- 2.Basicquestions -- 2.1.Feasibility -- 2.2.Unboundedness. |
505 8# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 2.3.Optimality -- 3.Optimalvaluerange -- 4.Setofoptimalsolutions -- 5.Basisstability -- 5.1. B-stability -- 5.2.Non-degenerate B-stability -- 6.Specialcases -- 6.1.Intervalright-handside -- 6.2.Intervalobjectivefunctioncoefficients -- 7.Duality -- 8.Conclusion -- 8.1.Applications -- 8.2.Software -- 8.3.Inverseproblems -- 8.4.Openproblems -- References -- THE INFINITE-DIMENSIONALLINEAR PROGRAMMING PROBLEMSAND THEIR APPROXIMATION -- Abstract -- 1.Introduction -- 2.DualSpacesandDualOperators -- 3.Infinite-DimensionalLinearProgramming -- 4.ApproximationandInterpolationofSpacesandOperators -- 5.ApproximationoftheLinearProgrammingProblems -- 6.NoetherOperatorsinLinearSpaces -- References -- PART II. APPLICATIONS IN MATHEMATICS -- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR MAXIMUM CONCURRENT FLOW PROBLEMS -- Abstract -- 1. Introduction -- 2. Preliminaries and Problem Formulation -- 3. Approximate Optimality Conditions and Exponential Length Functions -- 4. Analysis of the Combinatorial approximation Algorithm- CACF -- 5. Implementations and Applications -- 5.1. Implementations and Computational Results -- Conclusion and Discussions -- Acknowledgments -- References -- MINIMIZINGA REGULAR FUNCTIONON UNIFORMMACHINESWITH ORDERED COMPLETION TIMES -- Abstract -- 1.Introduction -- 2.Problem Q | rj , pmtn,Dj,C1 . .. Cn | F -- 3.Problem Q | rj , pmtn,Dj,C1 . .. Cn | PwjTj -- 4.Conclusion -- Acknowledgements -- References -- PART III. PRACTICAL APPLICATIONS -- LINEAR PROGRAMMING FOR IRRIGATION SCHEDULING - A CASE STUDY -- ABSTRACT -- NOTATIONS -- 1. INTRODUCTION -- 2. THE MODEL FORMULATION AND CONCEPT -- 3. THE CONCEPTUAL MODEL -- Variation of Evapotranspiration with the Available Soil Moisture -- Root Zone Depth Growth -- Relative Yield Ratio -- Water Requirements of the Crops -- 4. INTEGRATED LP FORMULATION -- 5. CROP SIMULATION MODEL. |
505 8# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 6. STOCHASTIC ANALYSIS OF EVAPOTRANSPIRATION -- 7. LP MODEL FORMULATION FOR OPTIMAL CROPPING PATTERN -- Model Application -- Real-Time Operation Program -- Main Program -- Subroutine for Framing Constraints -- LP Subroutine -- Post Processing Routine -- Updating Subroutine -- Analysis -- 10. RESULTS AND DISCUSSION -- Optimum Crop Pattern -- Results from Real-Time Operation Model (LP) -- Relative Yield Ratios -- CONCLUSION -- REFERENCES -- LINEAR PROGRAMMING FOR DAIRY HERD SIMULATION AND OPTIMIZATION: AN INTEGRATED APPROACH FOR DECISION-MAKING -- Abstract -- Introduction -- Dairy Herd Population Dynamics -- Markov-Chain Simulation -- Dynamic Transition Matrices -- The Need for Dynamic Programming -- The Need for Linear Programming -- Overview of the Next Sections -- Formulation of Linear Programming to Solve a Dynamic Programming Optimization Problem for Dairy Herd Management -- Mathematical Formulation -- Matrix Formulation -- 1. Set the Dimensions of the Model -- 2. Define the Transition Matrices -- 2.1. Involuntary Culling and Mortality -- 2.2. Reproduction and Abortion -- 2.3. Milk Production -- 3. Define the Expected Net Returns -- 3.1. Income over Feed Cost (IOFC) -- 3.2. Involuntary Culling Cost -- 3.3. Mortality Cost -- 3.4. Reproduction Cost -- 3.5. Income from Calving -- 4. Setting up the Model -- 5. Solve the Model -- 6. Analyze the Results -- Applications Using Linear Programming for Dairy Herd Simulation and Optimization -- 1. Monthly Model -- 2. Event-Driven Model -- Conclusion -- References -- A REVIEW ON LINEAR PROGRAMMING (LP) AND MIXED INTEGER LINEAR PROGRAMMING (MILP) APPLICATIONS IN CHEMICAL PROCESS SYNTHESIS -- Abstract -- Introduction -- Representation of Alternatives -- Developing Unit Models for Linear Mass Balances -- Mixer Unit -- Splitter Unit -- Reactor (Fixed Conversion Model) -- Flash Units -- Case1: / and P or T Fixed. |
505 8# - FORMATTED CONTENTS NOTE | |
Formatted contents note | Case 2: T and P Fixed -- Case 3: / and P (or T) Fixed -- Inclusion of Logic Inference in MILP Models -- Example 1. Reaction Path Synthesis (1) -- Example 2. Reaction Path Synthesis (2) -- Extension of Logic Inference to Heuristic Rules -- Modeling of Disjunctions -- Aggregated Process Optimization -- Example 3. Optimization of a Thermal Cracker via Linear Programming -- Example 4. Synthesis of a Chemical Plant -- Example 5. Superstructure Optimization by MILP Approach -- Reactor Networks -- Example 6. Stoichiometric Reaction Network -- Utility Systems -- Example 7. Boiler/Turbo-Generator System Optimization -- Utility Plant Synthesis through MILP Optimization -- Example 8. Utility Plant Synthesis -- Separation Systems -- Example 9. Membrane Separation -- Sequences of Distillation Columns -- Example 10 -- LP and MILP in Heat Exchanger Networks (HEN) -- Minimum Utilities Cost -- Example 11 -- Minimum Number of Heat Exchangers -- Conclusions -- References -- A MEDIUM-TERM PRODUCTION PLANNING PROBLEM: THE EPS LOGISTICS -- Abstract -- 1. Introduction -- 2. Introduction to the EPS Logistics -- 2.1. Manufacturing Section -- 2.2. Marketing Section -- 3. The MILP Model of EPS Logistics -- 3.1. Parameters and Variables -- 3.2. The MILP Model -- 3.3. Numerical Results -- Conclusion -- Appendix A: Analysis on Constraints of Finishing Line Operations -- A.1. Entity Analysis -- A.2. Boundary Analysis -- Appendix B: Analysis on Constraints of Material Supply Balance -- B.1. Entity Analysis -- B.1.1. Accumulation Balance -- B.1.2. Period Balance -- B.2. Mathematic Proof -- References -- COMPLEXITYOF DIFFERENT ILPMODELSOFTHEFREQUENCY ASSIGNMENT PROBLEM -- Abstract -- 1.Introduction -- 2.FrequencyAssignmentProblems -- 2.1.CommonApplicationDomains -- 2.1.1.MobilePhoneNetworks -- 2.1.2.RadioandTelevisionTransmission -- .1.3.MilitaryApplications. |
505 8# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 2.1.4.SatelliteCommunication -- 2.1.5.WirelessLocalAreaNetworks -- 2.2.ModelsofFrequencyPlanning -- 2.2.1.GeneralConstraints -- 2.2.2.F-FAP -- 2.2.3.Max-FAP -- 2.2.4.MO-FAP -- 2.2.5.MS-FAP -- 2.2.6.MI-FAP -- 3.ILPFormulationsofFAP -- 3.1.UsingBinaryVariables -- 3.1.1.F-FAP(Feasibility-FAP) -- 3.1.2.Max-FAP(MaximumServiceFAP) -- 3.1.3.MO-FAP(MinimumOrderFAP) -- 3.1.4.MS-FAP(MinimumSpanFAP) -- 3.2.UsingIntegerVariables -- 3.2.1.LinearizingAbsoluteValues -- 3.2.2.F-FAP(Feasibility-FAP) -- 3.2.3.MS-FAP(MinimumSpanFAP) -- 4.EmpiricalMeasurements -- 4.1.Implementation -- 4.1.1.TestingProcess -- 4.2.ComplexityofF-FAP -- 4.2.1.ConstantNumberofFrequenciesandCommunicationChannels -- 4.2.2.VaryingNumberofCommunicationChannels -- 4.2.3.VaryingNumberofFrequencies -- 4.3.ComparingDifferentILPFormulations -- 4.4.Sub-optimalSolutionsoftheOptimizationVersionsof FAP -- 4.5.AccelerationwithRestarts -- 5.Conclusion -- Acknowledgements -- ListofAbbreviations -- References -- OPTIMIZATION OF POLYGENERATION SYSTEMS SERVING A CLUSTER OF BUILDINGS -- Abstract -- Nomenclature -- Greek Letters -- Superscripts -- Subscripts -- Introduction -- Method for the Optimization of Polygeneration Systems -- Cost Models for the Main Plant Components -- Phisical Model and Mathematical Problem Formulation -- Single Building Optimization (SBO) -- Multi Building Optimization (MBO) -- Implementation Issues -- Power Plant Optimization and Smart Building Aggregation Algorithm -- Computational Burden -- The MATLAB Graphic User Interface -- Conclusions -- References -- LINEAR PROGRAMMING APPLIED FOR THE OPTIMIZATION OF HYDRO AND WIND ENERGY RESOURCES -- Abstract -- 1. Introduction -- Nomenclature -- 2. Problem Formulation -- 2.1. Short-Term Hydro Scheduling -- 1. Objective Function -- 2. Hydro Constraints -- 2.2. Development of Offering Strategies for Wind Power Producers. |
505 8# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 1. Objective Function. |
588 ## - SOURCE OF DESCRIPTION NOTE | |
Source of description note | Description based on publisher supplied metadata and other sources. |
590 ## - LOCAL NOTE (RLIN) | |
Local note | Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Linear programming. |
655 #4 - INDEX TERM--GENRE/FORM | |
Genre/form data or focus term | Electronic books. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Mann, Zoltn DM. |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Print version: |
Main entry heading | Mann, Zoltán Ádám |
Title | Linear Programming - New Frontiers in Theory and Applications |
Place, publisher, and date of publication | Hauppauge : Nova Science Publishers, Incorporated,c2012 |
International Standard Book Number | 9781612095790 |
797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN) | |
Corporate name or jurisdiction name as entry element | ProQuest (Firm) |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
Uniform title | Mathematics Research Developments |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3021711">https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3021711</a> |
Public note | Click to View |
No items available.