1
answer
0
watching
323
views
12 Nov 2019
Solve the following linear programming problem graphically: Maximize Z- 4x,+4X2 Subject to: 3x,+5X2 5150 X1-2X210 X1+3X2 150 x1. X220 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints 2) Using the point drawing tool, plot the five comer points which define the feasible region. The optimal solution is X1-O and x2-â¡ (round your responses to two docima,places. Maximum profit is$â¡ (enter your response as a whole number). Click the graph, choose a tool in the palette and tollow the instructions to create your graph MacBook A å0 2 3 4 5 6
Solve the following linear programming problem graphically: Maximize Z- 4x,+4X2 Subject to: 3x,+5X2 5150 X1-2X210 X1+3X2 150 x1. X220 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints 2) Using the point drawing tool, plot the five comer points which define the feasible region. The optimal solution is X1-O and x2-â¡ (round your responses to two docima,places. Maximum profit is$â¡ (enter your response as a whole number). Click the graph, choose a tool in the palette and tollow the instructions to create your graph MacBook A å0 2 3 4 5 6
Elin HesselLv2
27 Mar 2019