Question

4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54 x1 + x2 = 3 and X120, X2 0. DI (a) Solv

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

is Green Linear programming probleme - Max z = Quit 342 Elulb.fect to 1 +242 S4 hli + x2 = 3 x 7,0 42,0 @ (i) Treating 1st co心 2Now we check the realue of objective function - at the corner point of the feasible region. 1. At (211) Max Z= 2x2 + 3x1= 7 2- ) 18t we convert the brobleme to canonical form. iRtcom constraint is of a type, so we add a slack reanias and is an exuali2 for the 18t columnis. basis and Negative minimum y-ci is - - &t column Minimum ratio in in and now so an enters the 4 lеалоPLEASE RATE IF THIS WAS HELPFUL FOR YOU.

Add a comment
Know the answer?
Add Answer to:
4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54...
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