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