Linear Optimization and Extensions
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Linear Optimization and Extensions: (12 Algorithms and Combinatorics)
Linear Optimization and Extensions: (12 Algorithms and Combinatorics)

Linear Optimization and Extensions: (12 Algorithms and Combinatorics)


     0     
5
4
3
2
1



International Edition


X
About the Book

I was pleasantly surprised when I was asked by Springer-Verlag to prepare a second edition of this volume on Linear Optimization and Extensions, which - not exactly contrary to my personal expectations - has apparently been accepted reasonably weIl by the global optimization community. My objective in putting this book together was originally - and still is - to detail the major algorithmic ideas in linear optimization that have evolved in the past fifty years or so and that have changed the historical optimization "landscape" in substantial ways - both theoretically and computationally. While I may have overlooked the importance of some very recent developments - the work by Farid Alizadeh which generalizes linear programming to "sem i-definite" programming is perhaps a candidate for one of my omissions - I think that major new breakthraughs on those two fronts that interest me - theory and computation - have not occurred since this book was published originally. As a consequence I have restricted myself to a thorough re-working of the original manuscript with the goal of making it more readable. Of course, I have taken this opportunity to correct a few "Schönheitsfehler" of the first edition and to add some illustrations. The index to this volume has been extended substantially - to permit a hurried reader a quicker glance at the wealth of topics that were covered nevertheless already in the first edition. As was the case with the first edition, Dr.

Table of Contents:
The Linear Programming Problem.- Basic Concepts.- Five Preliminaries.- Simplex Algorithms.- Primal-Dual Pairs.- Analytical Geometry.- Projective Algorithms.- Ellipsoid Algorithms.- Combinatorial Optimization: An Introduction.

Review :
From the reviews of the second edition: "Do you know M.Padberg's Linear Optimization and Extensions (second edition, Springer-Verlag, Berlin, 1999)? If you teach a course on linear programming then you should know it. It is a successful book on LP with many application driven exercises. Now here is the continuation of it, discussing the solutions of all its exercises and with detailed analysis of the applications mentioned. Tell your student about it. ... For those who cherish the original textbook (students and lecturers) this is an extremely valuable sequel. For those who strive for good exercises and case studies for LP this is an excellent volume." Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 69, 2003 "Linear Optimization and Extensions – Problems and Solutions – is a solution manual for another book, released in 2000 … . The book is a very well planned and written. … For professors and interested students, the book can also serve as a source of advanced exercises. … the book will prove invaluable not only for students, but also for professionals in industry and universities. This is certainly an important addition to the literature of the area of linear programming." (Carlos Oliveria, SIGACT News, Vol. 35 (4), 2004)


Best Sellers


Product Details
  • ISBN-13: 9783642085116
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Edition: Revised edition
  • Language: English
  • Returnable: Y
  • Series Title: 12 Algorithms and Combinatorics
  • ISBN-10: 3642085113
  • Publisher Date: 15 Dec 2010
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 501
  • Returnable: N
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Linear Optimization and Extensions: (12 Algorithms and Combinatorics)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Linear Optimization and Extensions: (12 Algorithms and Combinatorics)
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 Optimization and Extensions: (12 Algorithms and Combinatorics)

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!