Theory and algorithms for linear optimization : an interior point approach

Bibliographic Information

Theory and algorithms for linear optimization : an interior point approach

C. Roos, T. Terlaky and J.-Ph. Vial

(Wiley-Interscience series in discrete mathematics and optimization)

Wiley, c1997

Available at  / 30 libraries

Search this Book/Journal

Note

"A Wiley-Interscience publication"

Includes bibliographical references and index

Description and Table of Contents

Description

Linear programming is an essential building block in the development of the theory of optimization. This text offers comprehensive coverage of the subject and research.

Table of Contents

Partial table of contents: INTRODUCTION: THEORY AND COMPLEXITY. Duality Theory for Linear Optimization. A Polynomial Algorithm for the Skew-Symmetric Model. Solving the Canonical Problem. THE LOGARITHMIC BARRIER APPROACH. The Dual Logarithmic Barrier Method. Initialization. THE TARGET-FOLLOWING APPROACH. The Primal-Dual Newton Method. Application to the Method of Centers. MISCELLANEOUS TOPICS. Karmarkar's Projective Method. More Properties of the Central Path. Partial Updating. High-Order Methods. Parametric and Sensitivity Analysis. Implementing Interior Point Methods. Appendices. Bibliography. Indexes.

by "Nielsen BookData"

Details

  • NCID
    BA30366537
  • ISBN
    • 0471956767
  • LCCN
    97134680
  • Country Code
    uk
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Chichester
  • Pages/Volumes
    xxiv, 482 p.
  • Size
    25 cm
  • Parent Bibliography ID
Page Top