This book serves as an introductory text in mathematical programming and optimization for students having a mathematical background that includes one semester of linear algebra and a complete calculus sequence. It includes computational examples to aid students develop computational skills.
Table of Contents
1. An Introduction to Mathematical Programming 2. Subspaces, Matrices, Affine Sets, Cones, Convex Sets, and the Linear Programming Problem 3. The Primal Simplex Procedure 4. Duality and the Linear Complementarity Problem 5. Other Simplex Procedures 6. Network Programming 7. Convex and Concave Functions 8. Optimality Conditions 9. Search Techniques for Unconstrained Optimization Problems 10. Penalty Function Methods