CHAPTER 6
INTEGER, GOAL, AND NONLINEAR PROGRAMMING
MODELS
SOLUTIONS TO DISCUSSION QUESTIONS
6-1.
6-3. In a pure IP model, all variables are integers whereas in a mixed-IP model, some but not all variables
6-4. Satisficing is a term used in GP because it is often not possible to “optimize” a multi-goal problem.
We come as close as possible to reaching goals.
6-6. A college president’s goals might be to (1) increase enrollments by 1,000 students; (2) stay within
6-7. Ranking goals just means more weight can be placed on one goal over another. The higher-ranked
goals must be achieved completely before GP moves on to meet lower-ranked goals.
6-8. The purpose of this question is to have the student come up with additional examples of NLP models
6-9. Unlike an LP model, the solution of an IP model need not be at a corner point. Since the simplex
procedure evaluates only corner points, we may have to solve several LP models in order to solve a single
6-10. In the weighted GP approach, we use weights to establish the relative importance of the deviation
6-11. When the objective function of a model contains squared terms (such as X2) and the constraints are
6-12.
(a) Linear