Clicking on the Chapter or Appendix in the table of contents below will link to a brief abstract of the chapter. The abstracts of the software appendices include links to relevant sites. There are also some errata. A corrected second printing is planned.
A solutions manual for the even numbered problems is nearing completion.
Section 1.1 Introduction
Section 2.1 Introduction
Section 3.1 Introduction
Section 4.1 Introduction
Section 5.1 Introduction
Section 6.1 Introduction
Section 7.1 Introduction
Section 8.1 Introduction to recursion
Section 9.1 Tweaking Widget's production
Section A.1 LINDO
Section B.1 The basics
Section C.1 A Brief Introduction to the TI-82
Section 10.1 Introduction
The Chapter 10 link above will lead to an abstract and a postscript version.
Section 1.2 Types of problems to be considered
Section 1.3 Sample problems
Section 1.4 Graphical solution of linear programs
Section 1.5 Summary and objectives
Chapter 2 Vectors and Matrices
Section 2.2 Vectors
Section 2.3 The span of a set of vectors
Section 2.4 Matrices
Section 2.5 Linear independence
Section 2.6 Systems of equations
Section 2.7 The inverse of a matrix
Section 2.8 Summary and objectives
Chapter 3 Linear Programming
Section 3.2 Slack variables
Section 3.3 The simplex algorithm
Section 3.4 Basic feasible solutions and extreme points
Section 3.5 Formulation examples
Section 3.6 General constraints and variables
Section 3.7 The dual and minimizing problems
Section 3.8 Sensitivity analysis
Section 3.9 Summary and objectives
Chapter 4 Network Models
Section 4.2 The transportation problem
Section 4.3 The critical path method
Section 4.4 Shortest path models
Section 4.5 Minimal spanning trees
Section 4.6 Summary and objectives
Chapter 5 Unconstrained Extrema
Section 5.2 Locating extrema
Section 5.3 The economic lot size model and convexity
Section 5.4 Location of extrema in two variables
Section 5.5 Least squares approximation
Section 5.6 The n-variable case
Section 5.7 Summary and objectives
Chapter 6 Constrained Extrema
Section 6.2 Two variable problems
Section 6.3 More variables; more constraints
Section 6.4 Problems having inequality constraints
Section 6.5 The convex programming problem
Section 6.6 Linear programming revisited
Section 6.7 Summary and objectives
Chapter 7 Integer Programming
Section 7.2 The knapsack problem
Section 7.3 The dual simplex algorithm
Section 7.4 Adding a constraint
Section 7.5 Branch and bound for integer programs:
Section 7.6 Basic integer programming models
Section 7.7 The traveling salesman problem
Section 7.8 Summary and objectives
Chapter 8 Introduction to Dynamic Programming
Section 8.2 The longest path
Section 8.3 A fixed cost transportation problem
Section 8.4 More examples
Section 8.5 Summary and objectives
Chapter 9 Case Studies
Section 9.2 A furniture sales opportunity
Section 9.3 Building storage lockers
Section 9.4 The McIntire farm
Section 9.5 Cylinders for beverages
Section 9.6 Books by the holidays
Section 9.7 Into a blind trust
Section 9.8 Max's taxes
Section 9.9 A supply network
Appendix A Brief Introductions to LINDO and LINGO
Section A.2 LINGO
Appendix B A Brief Introduction to Maple
Section B,2 Using packages
Appendix C Introduction to Texas Instruments Calculators
Section C.2 A Brief Introduction to the TI-92
Appendix D Selected Answers and Hints
References
Index
Supplements
Solutions to the Chapter 9 Cases
Chapter 10 Compound Interest
Section 10.2 Compound interest and savings
Section 10.3 Present value
Section 10.4 Mortgages
Section 10.5 Summary and objectives
Appendix A Selected Answers
Index