Consider the following linear programming problem: Minimize 20X + 30Y
Subject to: 2X + 4Y ≤ 800
6X + 3Y ≥ 300
X, Y ≥ 0
What is the optimum solution to this problem (X,Y)?
A)(0,0)
B)(50,0)
C)(0,100)
D)(400,0)

Question

Quizplus · Accepted Answer

The constraints of the problem can be graphed on a coordinate plane, and the feasible region determined by the intersection of the constraints. The objective function, 20X + 30Y, needs to be minimized. By evaluating the objective function at the vertices of the feasible region, it can be determined that the minimum value occurs at (50,0).

Consider the Following Linear Programming Problem: Minimize 20X + 30Y