Linear and nonlinear programming
Author(s)
Bibliographic Information
Linear and nonlinear programming
(McGraw-Hill series in industrial engineering and management science)
McGraw-Hill, c1996
Available at 14 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 661-677) and index
Description and Table of Contents
Description
This text presents linear and nonlinear programming in an integrated setting and serves as a complete and unified introduction to applications, theory, and algorithms.
Table of Contents
I Basics1 Optimization Models2 Fundamentals of Optimization3 Representation of Linear ConstraintsII Linear Programming4 Geometry of Linear Programming5 The Simplex MethodIII Introduction6 Duality and Sensitivity7 Enhancements of the Simplex Method8 Network Problems9 Computational Complexity of Computer ProgrammingIV Unconstained Nonlinear Optimization10 Basics of Unconstrained Optimization11 Methods for Unconstrained Optimization12 Low-Storage Methods13 Nonlinear Least-SquaresV Nonlinear Programming14 Optimality Conditions for Constrained Problems15 Feasible-Point Methods16 Penalty and Barrier Methods17 Interior Point MethodsAppendixes
by "Nielsen BookData"