Linear Programming: Mathematics, Theory and Algorithms
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Linear programming > Linear Programming: Mathematics, Theory and Algorithms: (2 Applied Optimization)
Linear Programming: Mathematics, Theory and Algorithms: (2 Applied Optimization)

Linear Programming: Mathematics, Theory and Algorithms: (2 Applied Optimization)


     0     
5
4
3
2
1



International Edition


X
About the Book

Linear Programming provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory. Audience: The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.

Table of Contents:
1. Introduction and Overview.- 2. Preliminary Mathematics.- 2.1 Vectors in Rn.- 2.2 Rank and Linear Transformations.- 2.3 The Solution Set of a System of Simultaneous Linear Equations.- 2.4 Orthogonal Projections and Least Squares Solutions.- 2.5 Point-Set Theory: Topological Properties of Rn.- 2.6 Hyperplanes and Half-Planes (-Spaces).- 2.7 Convex Sets.- 2.8 Existence of Separating and Supporting Hyperplanes.- 2.9 Convex Cones.- 2.10 Basic Solutions to Linear Equalities.- 2.11 Faces of Polyhedral Convex Sets: Extreme Points, Facets, and Edges.- 2.12 Extreme Point Representation for Polyhedral Convex Sets.- 2.13 Directions for Polyhedral Convex Sets.- 2.14 Combined Extreme Point and Extreme Direction Representation for Polyhedral Convex Sets.- 2.15 Resolution of Convex Polyhedra..- 2.16 Simplexes.- 2.18 Linear Functionals.- 3. Introduction to Linear Programming.- 3.1 The Canonical Form of a Linear Programming Problem.- 3.2 A Graphical Solution to the Linear Programming Problem.- 3.3 The Standard Form of a Linear Programming Problem.- 3.4 Properties of the Feasible Region.- 3.5 Existence and Location of Finite Optimal Solutions.- 3.6 Basic Feasible and Extreme Point Solutions to the Linear Programming Problem.- 3.7 Solutions and Requirements Spaces.- 4. Duality Theory.- 4.1 The Symmetric Dual.- 4.2 Unsymmetric Duals.- 4.3 Duality Theorems.- 5. The Theory of Linear Programming.- 5.1 Finding Primal Basic Feasible Solutions.- 5.2 The Reduced Primal Problem.- 5.3 The Primal Optimality Criterion.- 5.4 Constructing the Dual Solution.- 5.5 The Primal Simplex Method.- 5.6 Degenerate Basic Feasible Solutions.- 5.7 Unbounded Solutions Reexamined.- 5.8 Multiple Optimal Solutions.- 6. Duality Theory Revisited.- 6.1 The Geometry of Duality and Optimality.- 6.2 Lagrangian Saddle Points and Primal Optimality.- 7. Computational Aspects of Linear Programming.- 7.1 The Primal Simplex Method Reexamined.- 7.2 Improving a Basic Feasible Solution.- 7.3 The Cases of Multiple Optimal, Unbounded, and Degenerate Solutions.- 7.4 Summary of the Primal Simplex Method.- 7.5 Obtaining the Optimal Dual Solution From the Optimal Primal Matrix.- 8. One-Phase, Two-Phase, and Composite Methods of Linear Programming.- 8.1 Artificial Variables.- 8.2 The One-Phase Method.- 8.3 Inconsistency and Redundancy.- 8.4 Unbounded Solutions to the Artificial Problem.- 8.5 The Two-Phase Method.- 8.6 Obtaining the Optimal Primal Solution from the Optimal Dual Matrix.- 8.7 The Composite Simplex Method.- 9. Computational Aspects of Linear Programming: Selected Transformations.- 9.1 Minimizing the Objective Function.- 9.2 Unrestricted Variables.- 9.3 Bounded Variables.- 9.4 Interval Linear Programming.- 9.5 Absolute Value Functionals.- 10. The Dual Simplex, Primal-Dual, and Complementary Pivot Methods.- 10.1 Dual Simplex Method.- 10.2 Computational Aspects of the Dual Simplex Method.- 10.3 Dual Degeneracy.- 10.4 Summary of the Dual Simplex Method.- 10.5 Generating an Initial Primal-Optimal Basic Solution: The Artificial Constraint Method.- 10.6 Primal-Dual Method.- 10.7 Summary of the Primal-Dual Method.- 10.8 A Robust Primal-Dual Algorithm.- 10.9 The Complementary Pivot Method.- 11. Postoptimality Analysis I.- 11.1 Sensitivity Analysis.- 11.2 Structural Changes.- 12. Postoptimality Analysis II.- 12.1 Parametric Analysis.- 12.2 The Primal-Dual Method Revisited.- 13. Interior Point Methods.- 13.1 Optimization Over a Sphere.- 13.2 An Overview of Karmarkar’s Algorithm.- 13.3 The Projective Transformation T(X).- 13.4 The Transformed Problem.- 13.5 Potential Function Improvement andComputational Complexity.- 13.6 A Summary of Karmarkar’s Algorithm.- 13.7 Transforming a General Linear Program to Karmarkar Standard Form.- 13.8 Extensions and Modifications of Karmarkar’s Algorithm.- 13.9 Methods Related to Karmarkar’s Routine: Affine Scaling Scaling Algorithms.- 13.10 Methods Related to Karmarkar’s Routine: A Path-Following Following Algorithm.- 13.11 Methods Related to Karmarkar’s Routine: Potential Reduction Algorithms.- 13.12 Methods Related to Karmarkar’s Routine: A Homogeneous and Self-Dual Interior-Point, Method.- 14. Interior Point Algorithms for Solving Linear Complementarity Problems.- 14.1 Introduction.- 14.2 An Interior-Point, Path-Following Algorithm for LCP(q,M).- 14.3 An Interior-Point, Potential-Reduction Algorithm for LCP(q,M).- 14.4 A Predictor-Corrector Algorithm for Solving LCP(q,M).- 14.5 Large-Step Interior-Point Algorithms for Solving LCP(q,M).- 14.6 Related Methods for Solving LCP(q, M).- Appendix A: Updating the Basis Inverse.- Appendix B: Steepest Edge Simplex Methods.- Appendix C: Derivation of the Projection Matrix.- References.- Notation Index.

Review :
` ... a carefully written textbook in a clear style. It is a very informative introduction to this field and may be recommended to students as well as to everybody interested in this special field of applied mathematics.' Optimization, 43 (1998)


Best Sellers


Product Details
  • ISBN-13: 9781461334361
  • Publisher: Springer-Verlag New York Inc.
  • Publisher Imprint: Springer-Verlag New York Inc.
  • Height: 240 mm
  • No of Pages: 498
  • Returnable: Y
  • Width: 160 mm
  • ISBN-10: 1461334365
  • Publisher Date: 26 Jan 2012
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2 Applied Optimization


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Linear Programming: Mathematics, Theory and Algorithms: (2 Applied Optimization)
Springer-Verlag New York Inc. -
Linear Programming: Mathematics, Theory and Algorithms: (2 Applied Optimization)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Linear Programming: Mathematics, Theory and Algorithms: (2 Applied Optimization)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!