Data Analysis and Decision Modeling

13. A MINIMAX objective function in goal programming (GP): a. is used to minimize the maximum deviation from a goal b. is captured in a decision table c. is estimated by trial-and-error d. often produces an infeasible solution 14. A hard constraint a. cannot be violated b. may be violated c. is always binding d. is always part of the feasible solution 15. A soft constraint a. represents a target a decision-maker would like to achieve b. is always tight c. cannot be violated d. typically represents a single goal 16. Goal programming problems a. typically include a set of multiple goals b. cannot include hard constraints c. consist of soft constraints only d. must have a single objective function