MINIMIZATION BY THE SIMPLEX METHOD
convert each minimization problem into a maximization problem,
the dual, and then...
70.2K
Verified Solution
Link Copied!
Question
Basic Math
MINIMIZATION BY THE SIMPLEX METHOD
convert each minimization problem into a maximization problem,the dual, and then solve by the simplex method.
1>.
Minimize z = 6x1 +8x2
subject to 2x1 + 3x2 ?7
4x1 + 5x2 ? 9
x1, x2 ? 0
2>.
Minimize z = 4x1 +3x2
subject to x1 + x2 ?10
3x1 + 2x2 ? 24
x1, x2 ? 0
Answer & Explanation
Solved by verified expert
4.3 Ratings (758 Votes)
subject toIteration1Cj6800MMBCBXBx1x2S1S2A1A2MinRatioXBx2A1M72310107323333A2M94501019518Z16MZj6M8MMMMMZjCj6M68M8MM00Positive maximum ZjCj is8M8 and its column index is 2Minimum ratio is 18 and its row index is 2The pivot element is 5Entering x2
See Answer
Get Answers to Unlimited Questions
Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!
Membership Benefits:
Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
