Amazon cover image
Image from Amazon.com
Image from Coce

Introduction to linear optimization / Arkadi Nemirovski.

By: Material type: TextTextPublisher: New Jersey : World Scientific, 2024Description: xxii, 626 pages : illustrations ; 24 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9789811278730
Subject(s): DDC classification:
  • 519.72 N344i 23/eng/20231012
LOC classification:
  • QA402.5 .N4538 2024
Contents:
Introduction to LO: examples of LO models -- Part I. Geometry of linear optimization -- Polyhedral sets and their geometry -- Theory of systems of linear inequalities and duality -- Part II. Classical algorithms of linear optimization: the simplex method -- Simplex method -- The network simplex algorithm -- Part III. Complexity of linear optimization and the ellipsoid method -- Polynomial time solvability of linear optimization -- Part IV. Conic programming and interior point methods -- Conic programming -- Interior point methods for LO and semidefinite optimization -- Appendix A. Prerequisites from linear algebra -- Appendix B. Prerequisites from real analysis -- Appendix C. Symmetric matrics.
Summary: "A graduate level, rigorous, and self contained introduction to Linear Optimization. Comes with exercises and solutions. Appendices also provide brief summaries of the pre-requisite results for this book"-- Provided by publisher.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Shelving location Call number Copy number Status Date due Barcode
Books Books Main Library Circulation Section CIR 519.72 N344i 2024 (Browse shelf(Opens below)) 1-1 Available 032587

Includes bibliographical references and index.

Introduction to LO: examples of LO models -- Part I. Geometry of linear optimization -- Polyhedral sets and their geometry -- Theory of systems of linear inequalities and duality -- Part II. Classical algorithms of linear optimization: the simplex method -- Simplex method -- The network simplex algorithm -- Part III. Complexity of linear optimization and the ellipsoid method -- Polynomial time solvability of linear optimization -- Part IV. Conic programming and interior point methods -- Conic programming -- Interior point methods for LO and semidefinite optimization -- Appendix A. Prerequisites from linear algebra -- Appendix B. Prerequisites from real analysis -- Appendix C. Symmetric matrics.

"A graduate level, rigorous, and self contained introduction to Linear Optimization. Comes with exercises and solutions. Appendices also provide brief summaries of the pre-requisite results for this book"-- Provided by publisher.

There are no comments on this title.

to post a comment.