This introductory text provides undergraduate and graduate students with a concise and practical introduction to the primary concepts and techniques of optimization. Practicing engineers and managers will also find useful its concentration on problems and examples relevant to them. With a strong emphasis on basic concepts and techniques throughout, the book explains the theory behind each technique as simply as possible, along with illustrations and worked examples. It gives a balanced treatment of both the linear and nonlinear programming, plus search techniques, geometric programming, and game theory. Some typical problems varying in difficulty level are solved so readers can appreciate intricacies of the underlying concepts useful for practical problem solving. Suitable for individual or group learning, the book also includes numerous end-of-chapter problems for study and review.
|Publisher:||Springer Berlin Heidelberg|
|Edition description:||Softcover reprint of hardcover 1st ed. 2004|
|Product dimensions:||6.10(w) x 9.25(h) x 0.24(d)|
Table of Contents
Formulation.- Geometry of Linear Programming.- The Simplex Algorithm.- Advanced Linear Programming.- Duality Theory.- Sensitivity Analysis.- Transportation Problems.- Network Analysis.- Project Management.- Sequencing Problems.- Integer Programming.- Dynamic Programming.- Nonlinear Programming.- Search Techniques.- Geometric Programming.- Goal Programming.- Games Theory.- Special Topics.