Consider the following linear programming problem: The feasible corner points are (48,84), (0,120), (0,0), (90,0).What is the maximum possible value for the objective function?
A)1032
B)1200
C)360
D)1600
E)None of the above

Question

Consider the following linear programming problem:  The feasible corner points are (48,84), (0,120), (0,0), (90,0).What is the maximum possible value for the objective function?
A)1032 
B)1200 
C)360 
D)1600 
E)None of the above

Quizplus · Accepted Answer

We can plug in the coordinate values of each feasible corner point into the objective function to find the maximum value.
For (48,84), the objective function value is $12(48)+8(84)=576+672=1248$.
For (0,120), the objective function value is $12(0)+8(120)=0+960=960$.
For (0,0), the objective function value is $12(0)+8(0)=0+0=0$.
For (90,0), the objective function value is $12(90)+8(0)=1080+0=1080$.
Therefore, the maximum objective function value is 1248, which occurs at point (48,84).

Consider the Following Linear Programming Problem: the Feasible Corner