¿This textbook on Linear and Nonlinear Optimization is intended for graduate and advanced undergraduate students in operations research and related fields. It is both literate and mathematically strong, yet requires no prior course in optimization. As suggested by its title, the book is divided into two parts covering in their individual chapters LP Models and Applications; Linear Equations and Inequalities; The Simplex Algorithm; Simplex Algorithm Continued; Duality and the Dual Simplex Algorithm; Postoptimality Analyses; Computational Considerations; Nonlinear (NLP) Models and Applications; Unconstrained Optimization; Descent Methods; Optimality Conditions; Problems with Linear Constraints; Problems with Nonlinear Constraints; Interior-Point Methods; and an Appendix covering Mathematical Concepts. Each chapter ends with a set of exercises.The book is based on lecture notes the authors have used in numerous optimization courses the authors have taught at StanfordUniversity. It emphasizes modeling and numerical algorithms for optimization with continuous (not integer) variables. The discussion presents the underlying theory without always focusing on formal mathematical proofs (which can be found in cited references). Another feature of this book is its inclusion of cultural and historical matters, most often appearing among the footnotes.

Entirely readable yet mathematically rigorous

Chapter 1. LP Models and Applications.- Chapter 2. Linear Equations and Inequalities.- Chapter 3. The Simplex Algorithm.- Chapter 4. The Simplex Algorithm Continued.- Chapter 5. Duality and the Dual Simplex Algorithm.- Chapter 6. Postoptimality Analysis.- Chapter 7. Some Computational Considerations.- Chapter 8. NLP Models and Applications.- Chapter 9. Unconstrained Optimization.- Chapter 10. Descent Methods.- Chapter 11. Optimality Conditions.- Chapter 12. Problems with Linear Constraints.- Chapter 13. Problems with Nonlinear Constraints.- Chapter 14. Interior-Point Methods.