Question: Part Three: (50%) We have the following linear programming model: MAX Z = 3x1 + 4X2 SUBJECT TO 2x1 + x 6 2x1 + 3x2

Part Three: (50%) We have the following linear programming model: MAX Z = 3x1 + 4X2 SUBJECT TO 2x1 + x 6 2x1 + 3x2 9 X1, X2 0 (P1) Draw a graph for this model and find its optimal solution (Indicate this optimal solution in the graph). (P2) Both variables in the model are required to be integers, what is the optimal solution now (Indicate this optimal solution in the graph)? (P3) Compare these two models and discuss them briefly (the number of feasible solutions, the optimal solutions are the same or not).

Part Three: (50%) We have the following linear programming model: MAXz=3x1+4x2 SUBJECT TO 2x1+x262x1+3x29x1,x20 (P1) Draw a graph for this model and find its optimal solution (Indicate this optimal solution in the graph). (P2) Both variables in the model are required to be integers, what is the optimal solution now (Indicate this optimal solution in the graph)? (P3) Compare these two models and discuss them briefly (the number of feasible solutions, the optimal solutions are the same or not)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

Solve the following linear programming model graphically: maximize Z = 3x1 + 2x2 subject to 2x1 + 4x2 22 -x1 + 4x2 10 4x1 - 2x2 14 x1 - 3x2 1 x1, x2 0 LO.1

Use the branch and bound algorithm to solve the following integer programming model maximize Z = 3x 1 + 4x 2 Subject to: 2x 1 + x 2 6 2x 1 + 3x 2 9 x1 0, x 2 0 and both are integers

Use the graphical method to maximize the following linear programming model: Maximize Z = 8x 1 + 4x 2 Subject to the following constraints: 2x 1 + 3x 2 24 2x 1 + x 2 16 x 1 , x 2 0.

Consider the following linear programming problem: Max Z = 3x1 + 2x2 Subject to: 4x1 + 2x2

Consider the following linear programming problem: Max Z = 3x1 + 2x2 Subject to: 4x1 + 2x2 = 200 2X1 + 3x2 0 X2 constraint 1 100 optimal point objective function 60 B (30,40) constraint 2 Feasible...

pleas solve it carefully and do the graph by hand writing Graphical LP Solution (50 pts). Consider the following linear programming problem: Max Z = X1 + 3X2 subject to: 2x1 + x2 0 a. Graph the...

If the objective function coefficient for x1 was to increase from $40 to $50, how much additional revenue would be generated? Consider the following linear programming model Max Z= 40x4 + 30x,...

43 Consider the following linear programming formulation: Max Z = 3X1 + 2X2 - 3X3 Subject to 2X1 +3X2 + 4X3 12 X, 2X2 X3 22 X1 +5X2 - 3X3 = 20 X1, X2, X20 The optimal solution is OBJECTIVE FUNCTION...

how Need help answering my study guide I get some of the problems but still need further explaining on them. 19] Companies A, B, and C supply components to three plants (F, G, and H] via two...

Consider the following linear programming problem: Max Z = 120X1 + 100x2 Subject to: 3X1 + 4x2 2 6 (constraint 1) 10x1 + 9x2 2 33 (constraint 2) 2x1 + 3x2 = 29 (constraint 3) 4x1 + 8x2 = 42...

Family C has eight children: three girls, one boy, and then four more girls. Family D also has eight children: two girls, one boy, one girl, three boys, and then a girl. Which type of family is more...

In the Solow model, if the first unit of capital increases output by one unit, then the second unit of capital will cause total output to? A. Increase, but by less than one unit. B. double. C. remain...

Your Task: Look at the case of Company S Ltd . In 2 0 2 0 , S Ltd . became an incorporated firm with the following details / criteria: The company had 1 0 0 shareholders. All shareholders were...

please answer only if you know programming language is c++ For this lab, your objective is to define the functions below. Define the void function SwapNodes () that takes three generic type Node...