Question: Solve the following goal programming problem by the simplex method for goal programming Min z = P 3 n 1 + P 4 p 2

Solve the following goal programming problem by the simplex method for goal programming

Min z = P3n1 + P4p2 + P4p3 + P1p4 + P2n5

St 6x1 + 4x2 + n1 p1 = 100

2x1 + 1x2 + n2 p2 = 10

1x1 + 1x2 + n3 p3 = 8

n2 + n3 + n4 p4 = 16

1x2 + n5 = 7

All variables >= 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:

please help me out with these questions QUESTION 1 Solve the following linear programming problem using the simplex method Maximize Z=R100X1+R60X2 subject to 4X1+2X2603X1+2X290X1,X20 QUESTION 2 A...

Q:

QUESTION TWO (a) Solve the following Linear programming problem using the simplex method: Maximize Z = 10X, +15X2 + 20X, subject to: 2X1 + 4X2 +6X, 24 3X1 +9X, +6X, 0 (15 Marks) (6) Suppose X1, X3,...

Q:

Can someone please answer the following questions. Please show work or explanation for each problem. I rate if the answers are correct with work or explanation provided. Thank you in advance!...

Q:

3. (a) (25 points) Solve the following linear programming problem using the simplex method. Show that the optimal value is 39.9, and write down an optimal solution. Maximize 13.01 + 15x2 + 12x3...

Q:

I need some help here please. Solve the following linear programming problem using the simplex method: Minimize: Z=X1+2X2 subject to X1+3X28X1+2X23X1+2X2X2X1,X290160120700 Solve the following linear...

Q:

10. (10 points) Solve the following linear programming problem using the simplex method. You must complete and show each pivot "by hand". Be sure you also state the optimal solution (x1,x2 and z...

Q:

Solve the following linear programming problem using Revised Simplex Method: Maximize Z = x 1 + 2x 2 Subject to: x 1 + x 2 3 x 1 + 2x 2 5 3x 1 + x 2 6 where x 1 , x 2 0

Q:

2. Solve the following linear programming problem using the simplex method and showing your tableaus after the answer box. Maximize z = - 3x1 + X2 s.t. X1+4x2

Q:

QUESTION 4 Solve the following linear programming problem using the simplex method: Minimize: Z = X1 + 2X2 subject to X1+3X2 90 8X1 +2X2 160 3X1 +2X2 120 X2 70 X1, X2 0

Q:

(a) Solve the following linear programming problem using the Simplex method: Max Z = 10X1 + 12X2 + 8X3 Subject to the constraints 3x1 + X2 + 2x3 = 100 X1 + 4X2 + X3 - 120 2x1 + 3x2 5 80 x1 2 0, X2 2...

Q:

Does a typical microwave oven utilize feedback control to set cooking temperature or to determine If the food is cooked? If not, what mechanism is used? Can you think of any disadvantages to this...

Q:

Find the common difference d for the arithmetic sequence. -4, -3, -2, -1, ... d=

Q:

ExomMobil is considering huwing a 1 5 - year convertible bond that will be priced at its $ 1 , 0 0 0 par value. The bonds have a 6 . 5 $ annual coupon rate, and each bond can be converted into 2 0...

Q:

What is an example of constructive feedback? provide reference