Question: The feasible region for a linear program is identified by these constraints: 2A 1B 0; -1A + 1.5B 200; A 0; B 0. An optimizing
The feasible region for a linear program is identified by these constraints: 2A 1B 0; -1A + 1.5B 200; A 0; B 0. An optimizing student in the management science class is interested in finding the best feasible solution under TWO different objectives: Objective 1 maximizes 4A + B; Objective 2 minimizes A + B. Which of the following statements is true about this linear program?
The LP has 5 corner points.
(100,0) is a feasible point for the LP.
(100, 200) maximizes objective 1 and (0, 0) minimizes objective 2.
(0, 133.33) maximizes objective 1 and the same corner point also minimizes objective 2.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
