Buy Large Scale Linear and Integer Optimization: A Unified Approach
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Business and Economics > Business and Management > Operational research > Large Scale Linear and Integer Optimization: A Unified Approach
Large Scale Linear and Integer Optimization: A Unified Approach

Large Scale Linear and Integer Optimization: A Unified Approach


     0     
5
4
3
2
1



International Edition


X
About the Book

There is a growing need in major industries such as airlines, trucking, and financial engineering, to solve very large linear and integer linear optimization problems. Because of the dramatic increase in computing power, it is now possible to solve these problems. Along with the increase in computer power, the mathematical programming community has developed better and more powerful algorithms to solve very large problems. These algorithms are of interest to many researchers in the areas of operations research/management science, computer science, and engineering. In this book, Kipp Martin has systematically provided users with a unified treatment of the algorithms and the implementation of the algorithms that are important in solving large problems. Parts I and II provide an introduction to linear optimization using two simple but unifying ideas - projection and inverse projection. The ideas of projection and inverse projection are also extended to integer linear optimization. With the projection-inverse projection approach, theoretical results in integer linear optimization become much more analogous to their linear optimization counterparts. Hence, with an understanding of these two concepts, the reader is equipped to understand fundamental theorems in an intuitive way. Part III presents the most important algorithms that are used in commercial software for solving real-world problems. Part IV shows how to take advantage of the special structure in very large scale applications through decomposition. Part V describes how to take advantage of special structureby modifying and enhancing the algorithms developed in Part III. This section contains a discussion of research in linear and integer linear programming. The author also shows in Part V how to take different problem formulations and appropriately "modify" them so that the algorithms from Part III are more efficient. Again, the projection and inverse projection concepts are used in Part V to present the current research inlinear and integer linear optimization in a very unified way. While the book is written for a mathematically mature audience, no prior knowledge of linear or integer linear optimization is assumed. The audience is upper-level undergraduate students and graduate students in computer science, applied mathematics, industrial engineering and operations research/management science. Course work in linear algebra and analysis is sufficient background.

Table of Contents:
1 Linear and Integer Linear Optimization.- 2 Linear Systems and Projection.- 3 Linear Systems and Inverse Projection.- 4 Integer Linear Systems: Projection and Inverse Projection.- 5 The Simplex Algorithm.- 6 More on Simplex.- 7 Interior Point Algorithms: Polyhedral Transformations.- 8 Interior Point Algorithms: Barrier Methods.- 9 Integer Programming.- 10 Projection: Benders’ Decomposition.- 11 Inverse Projection: Dantzig-Wolfe Decomposition.- 12 Lagrangian Methods.- 13 Sparse Methods.- 14 Network Flow Linear Programs.- 15 Large Integer Programs: Preprocessing and Cutting Planes.- 16 Large Integer Programs: Projection and Inverse Projection.- VI Appendix.- A Polyhedral Theory.- A.1 Introduction.- A.2 Concepts and Definitions.- A.3 Faces of Polyhedra.- A.4 Finite Basis Theorems.- A.5 Inner Products, Subspaces and Orthogonal Subspaces.- A. 6 Exercises.- B Complexity Theory.- B.1 Introduction.- B.2 Solution Sizes.- B.3 The Turing Machine.- B.4 Complexity Classes.- B.5 Satisfiability.- B.7 Complexity of Gaussian Elimination.- B.8 Exercises.- C Basic Graph Theory.- D Software And Test Problems.- E NOTATION.- References.- Author Index.- Topic Index.

Review :
From the reviews of the first edition: "This book is a very comprehensive textbook of linear and integer optimization. It presents a unified approach to the subject and is one of the few books treating linear and integer aspects together. ! This is an interesting book with special features. ! The text is written in a clear and readily comprehensible way, and it contains computer programs as well as many examples being helpful for students. This book is an important textbook of mathematical programming." (Johannes Jahn, Zentralblatt MATH, Vol. 1053 (4), 2005)


Best Sellers


Product Details
  • ISBN-13: 9780792382027
  • Publisher: Kluwer Academic Publishers
  • Publisher Imprint: Kluwer Academic Publishers
  • Height: 235 mm
  • No of Pages: 740
  • Returnable: Y
  • ISBN-10: 0792382021
  • Publisher Date: 30 Nov 1998
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Large Scale Linear and Integer Optimization: A Unified Approach
Kluwer Academic Publishers -
Large Scale Linear and Integer Optimization: A Unified Approach
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.

Large Scale Linear and Integer Optimization: A Unified Approach

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!