Question

Solve by solving the dual problem. Minimize z = 30x1 + 15x2 + 28x3, subject to 5x1 + 3x2 + 4x3...

Solve by solving the dual problem.

Minimize

z = 30x1 + 15x2 + 28x3,

subject to

5x1 + 3x2 + 4x3 45
5x1 + 6x2 + 8x3 120
20x1 + 6x2 + 14x3 300
x1 0, x2 0, x3 0.

x_1=

x_2=

x_3=

z=

0 0
Add a comment Improve this question Transcribed image text
Answer #1

The given Linear Programming Problem is- Mimmize z= 30x4 + 15% + 2883 Subject to, 5%,+ 3x2 + 423 745 5x, + 6x₂ + 813 3 120 20

o 0 Let us solve the LPP using simplex method, Introducing slack variable wy. Ws, we one to each constrain, the converted equ

Hence, the required solution is, Z=-510, ats 21-27, x2=10 23=0,

Add a comment
Know the answer?
Add Answer to:
Solve by solving the dual problem. Minimize z = 30x1 + 15x2 + 28x3, subject to 5x1 + 3x2 + 4x3...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT