Reference no: EM132241227
1. The term ‘iterative solution procedure’ means that:
a. Optimal solution can be found quickly.
b. The decision maker investigates a variety of solutions to find one that is most satisfactory.
c. The solution algorithm executes in cycles.
d. A known number of iterations is required to find the optimal solution to the problem.
2. Problems that model a situation when multiple conflicting objectives occur are called:
a. Multiple objective linear programming (MOLP) problems.
b. Decision problems.
c. Conflict problems.
d. Stress problems.
3. The key concept in goal programming (GP) is:
a. Recognizing the key goals.
b. Relaxing the hard constraints.
c. Limiting the number of soft constraints.
d. Reconciling trade-offs between conflicting goals.
4. In multi objective linear programming (MOLP) minimization problem, one way to minimize undesirable deviation from target for a goal in the optimal solution is to:
a. Assign a small positive value to the weight associated with this goal in the objective function.
b. Remove the goal from the objective function.
c. Assign a zero value to the weight associated with this goal in the objective function.
d. Assign a large value to the weight associated with this goal in the objective function.