Redundancy in Mathematical Programming: A State-of-the-Art Survey: Lecture Notes in Economics and Mathematical Systems, cartea 206
Autor M. H. Karwan, V. Lotfi, J. Telgen, S. Ziontsen Limba Engleză Paperback – apr 1983
Din seria Lecture Notes in Economics and Mathematical Systems
- Preț: 360.02 lei
- Preț: 279.18 lei
- Preț: 376.22 lei
- Preț: 376.38 lei
- Preț: 372.44 lei
- Preț: 437.28 lei
- Preț: 487.36 lei
- Preț: 373.19 lei
- Preț: 377.13 lei
- Preț: 370.73 lei
- Preț: 391.64 lei
- 20% Preț: 353.67 lei
- 15% Preț: 630.15 lei
- Preț: 371.48 lei
- Preț: 404.74 lei
- Preț: 377.87 lei
- 15% Preț: 631.45 lei
- Preț: 371.48 lei
- Preț: 338.57 lei
- Preț: 417.23 lei
- Preț: 370.73 lei
- 18% Preț: 759.94 lei
- Preț: 384.70 lei
- Preț: 393.55 lei
- 15% Preț: 633.36 lei
- Preț: 374.51 lei
- Preț: 370.73 lei
- 15% Preț: 624.71 lei
- 15% Preț: 634.18 lei
- Preț: 370.15 lei
- Preț: 438.82 lei
- 15% Preț: 631.45 lei
- Preț: 378.26 lei
- 15% Preț: 641.20 lei
- Preț: 406.68 lei
- Preț: 403.26 lei
- Preț: 390.88 lei
- Preț: 390.88 lei
- Preț: 384.86 lei
- 15% Preț: 622.64 lei
- 20% Preț: 640.35 lei
- Preț: 372.24 lei
- Preț: 485.49 lei
- Preț: 438.99 lei
- Preț: 371.10 lei
- 15% Preț: 624.26 lei
- Preț: 378.08 lei
- Preț: 370.94 lei
- 15% Preț: 653.08 lei
Preț: 629.70 lei
Preț vechi: 740.82 lei
-15% Nou
Puncte Express: 945
Preț estimativ în valută:
120.52€ • 126.44$ • 99.98£
120.52€ • 126.44$ • 99.98£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540115526
ISBN-10: 3540115528
Pagini: 300
Ilustrații: VIII, 290 p.
Dimensiuni: 170 x 244 x 16 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1983
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Economics and Mathematical Systems
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540115528
Pagini: 300
Ilustrații: VIII, 290 p.
Dimensiuni: 170 x 244 x 16 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1983
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Economics and Mathematical Systems
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
1. An Introduction to Redundancy.- 1.1 Redundancy.- 1.2 Causes of Redundancy.- 1.3 Consequences of Redundancy.- 1.4 Dealing with Redundancy.- 1.5 A Survey of the Literature.- 1.6 Objective and Plan of the Study.- 2. Mathematical Foundations and Notation.- 2.1 Notation.- 2.2 Terminology.- 2.3 A Categorization of Methods.- 2.4 Some Common Theory.- 3. A Method for Identifying Redundant Constraints and Extraneous Variables in Linear Programming.- 3.1 An Intuitive Exposition of the Approach.- 3.2 The Algorithm.- 3.3 Theory.- 3.4 An Example.- 3.5 Conclusion.- 4. A Method for Determining Redundant Constraints.- 4.1 An Intuitive Exposition of the Method.- 4.2 The Algorithm.- 4.3 Theoretical Background.- 4.4 An Illustrative Example.- 4.5 Conclusion.- 5. Identifying Redundancy in Systems of Linear Constraints.- 5.1 Introduction.- 5.2 Intuitive Exposition of the Approach.- 5.3 Description of the Algorithm.- 5.4 Mathematical Theory.- 5.5 Special Aspects of the Approach.- 5.6 Example.- 6. Finding Redundant Constraints in Sets of Linear Inequalities.- 6.1 Introduction.- 6.2 Intuitive Exposition of the Approach.- 6.3 The Algorithm.- 6.4 Mathematical Theory.- 6.5 Special Aspects of the Approach.- 6.6 An Example.- 6.7 Conclusion.- 7. A Method for Finding Redundant Constraints of a System of Linear Inequalities.- 7.1 An Intuitive Exposition of the Approach.- 7.2 Description of the Algorithm.- 7.3 Mathematical Theory.- 7.4 Special Aspects of the Approach.- 7.5 An Example.- 7.6 Conclusion.- 8. Some Reduction of Linear Programs Using Bounds on Problem Variables.- 8.1 Introduction.- 8.2 An Intuitive Exposition of the Approach.- 8.3 Description of the Algorithm.- 8.4 Mathematical Theory.- 8.5 Special Aspects of the Approach.- 8.6 An Example.- 8.7 Conclusion.- 9. A Reduction Procedure for Linear and Integer Programming Models.- 9.1 Introduction.- 9.2 Primal and Dual Observations.- 9.3 The Tests.- 9.4 Applying the Tests.- 9.5 Implementation Considerations.- 9.6 Numerical Examples.- 9.7 Conclusions.- 10. Preduce — A Probabilistic Algorithm Identifying Redundancy by a Random Feasible Point Generator (RFPG).- 10.1 Introduction.- 10.2 An Intuitive Exposition of Algorithm PREDUCE.- 10.3 Description of Algorithm PREDUCE.- 10.4 Mathematical Theory.- 10.5 Special Aspects of PREDUCE.- 10.6 A Numerical Example.- 11. The Noncandidate Constraint Method.- 11.1 Introduction.- 11.2 An Intuitive Explanation of the Method.- 11.3 Description of the Algorithm.- 11.4 Special Aspects of the Noncandidate Method.- 11.5 Solution of an Example.- 11.6 Conclusions.- 12. Structural Redundancy in Large-Scale Optimization Models.- 12.1 Introduction.- 12.2 Overview of the Analysis.- 12.3 Details of the Analysis.- 12.4 Extensions to Mixed Integer and Nonlinear Models.- 12.5 Conclusion.- 12.6 Acknowledgments.- 13. Programming the Methods and Experimental Design.- 13.1 Programming the Methods.- 13.2 Performance Monitoring.- 13.3 Test Problems.- 13.4 Summary.- 14. Results of the Sign Test Methods.- 14.1 Results for the Randomly Generated Problems.- 14.2 Problem Differences.- 14.3 Method Efficiencies Versus Time.- 14.4 Efficiency of the Various Tests.- 14.5 Results for the Structured Problems.- 15. Results of the Other Methods.- 15.1 Boneh’s Method.- 15.2 Mattheiss’ Method.- 15.3 Klein and Holm’s Method.- 15.4 Williams’ Method.- 15.5 The Method of Sethi and Thompson.- 15.6 Summary.- 16. Improvements and Extensions.- 16.1 The Extended Sign Test Method.- 16.2 The Hybrid Method.- 16.3 The Reduce Method.- 17. Results of the Improvements and Extensions.- 17.1 The Extended Sign TestMethod.- 17.2 The Hybrid Method.- 17.3 The Reduce Method.- 18. Conclusions.- 18.1 Summary of the Test Results.- 18.2 Other Developments and Conclusions.- References.