Question: Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 20 Subjective 2: 3X1 +3

Solve the following problem using graphical linear programming

Objective: Minimize Z=8X1 +12 X2

Subject to:

Subjective 1: 5X1 +2 X2 20

Subjective 2: 3X1 +3 X2 21

Subjective 3: X1 + 3 X2 9

Optimal solution for the objective function Z = _______

A.

Optimal solution for the objective function Z = 60
B.

Optimal solution for the objective function Z = 64

C.

Optimal solution for the objective function Z = 120
D.

Optimal solution for the objective function Z = 0

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!

Q:

Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 20 Subjective 2: 3X1 +3 X2 21 Subjective 3: X1 + 3 X2 9 What are...

Q:

Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 20 Subjective 2: 3X1 +3 X2 21 Subjective 3: X1 + 3 X2 9 What is the...

Q:

Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 20 Subjective 2: 3X1 +3 X2 21 Subjective 3: X1 + 3 X2 9 What is the...

Q:

QUESTION 3 Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 2 20 Subjective 2: 3x1 +3 X2 2 21 Subjective 3: X2 22...

Q:

QUESTION 6 Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 + X2 2 20 Subjective 2: 3X1 +3 X2 2 21 Subjective 3: X2 22...

Q:

QUESTION 4 Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 2 20 Subjective 2: 3X1 +3 X2 2 21 Subjective 3: X2 2 2...

Q:

QUESTION 5 Solve the following problem using graphical linear programming Objective: Minimize Z=8X1 +12 X2 Subject to: Subjective 1: 5X1 +2 X2 2 20 Subjective 2: 3X1 +3 X2 2 21 Subjective 3: X222...

Q:

Q1. Solve the following problem, using the Corner Point Method. Maximize profit = 30x1 + 40x2 Subject to 4x1 + 2x2 ? 16 2x1 - x2 ? 2 x2 ? 2 x1, x2 ? 0 a) Draw lines graphically and show the feasible...

Q:

Let A = {1, 3, 5, 7}; B = {5, 6, 7, 8}; C = {5, 8}; D = {2, 5, 8}; and U = {1, 2, 3, 4, 5, 6, 7, 8}. Determine whether the given statement is true or false. 26) C 9 D A) True B) False Let A = {6, 4,...

Q:

Algebra Matrices Use graphical methods to solve this linear Maximize z = 5x + 2y programming problem. subject to: 6x - y s 16 3x + y > 12 x23 ys9 2 Use graphical methods to solve this linear Maximize...

Q:

A multiprocessor with eight processors has 20 attached tape drives. There is a large number of jobs submitted to the system that each require a maximum of four tape drives to complete execution....

Q:

Basic arranging is an expert arranging discipline that blueprints with the game plan, progression, and upkeep of the physical and normally made climate, including public works like streets, ranges,...

Q:

The production - volume variance, which relates only to fixed manufacturing overhead, exists under absorption costing but not under variable costing. True False

Q:

Hugo decides to buy his Christmas gifts on Black Friday. To simplify his life, he is giving his 10 closest friends scarves for Christmas and everyone else Christmas cards. Hugo is willing to pay up...