Multiple Choice
If no other feasible solution to a multi-objective linear programming (MOLP) problem allows an increase in any objective without decreasing at least one other objective, the solution is said to be
A) dually optimal.
B) Pareto optimal.
C) suboptimal.
D) maximally optimal.
Correct Answer:

Verified
Correct Answer:
Verified
Q9: Exhibit 7.2<br>The following questions are based on
Q10: Deviational variables<br>A) are added to constraints to
Q11: Goal programming solution feedback indicates that the
Q12: The "triple bottom line" incorporates multiple objective
Q13: What is the soft constraint form of
Q15: Robert Gardner runs a small, local-only delivery
Q16: A constraint which cannot be violated is
Q17: Suppose that the first goal in a
Q18: What weight would be assigned to a
Q19: A constraint which represents a target value