Consider the following linear programming problem: Maximize Z = 4X1 + 10X2 Subject to:         3X1 + 4X2 =< 480 4X1 + 2X2 =< 360 all variables => 0 The feasible corner points are (48,84),(0,120),(0,0),(90,0)

Subject:Electrical EngineeringPrice:2.87 Bought7

Share With

Consider the following linear programming problem:

Maximize Z = 4X1 + 10X2

Subject to:         3X1 + 4X2 =< 480

4X1 + 2X2 =< 360

all variables => 0

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.