Linear and Nonlinear Programming

I* Basics 1 Optimization Models 2 Fundamentals of Optimization 3 Representation of Linear Constraints II Linear Programming 4 Geometry of Linear Programming 5 The Simplex Method Introduction 6 Duality and Sensitivity 7 Enhancements of the Simplex Method 8 Network Problems 9 Computational Complexity of Computer Programming III Unconstained Nonlinear Optimization 10 Basics of Unconstrained Optimization 11 Methods for Unconstrained Optimization 12 Low-Storage Methods 13 Nonlinear Least-Squares IV *Nonlinear Programming 14 Optimality Conditions for Constrained Problems 15 Feasible-Point Methods 16 Penalty and Barrier Methods 17 Interior Point Methods Appendixes