Question
Use the simplex algorithm to find the optimal solution to the following LP: maxz=36x1 +30x2 3x3 4x4 s.t. x1+x2 x3 <5 6x1 +5x2 x4 <10
Use the simplex algorithm to find the optimal solution to the following LP:
maxz=36x1 +30x2 –3x3 –4x4
s.t.
x1+x2 –x3<5
6x1 +5x2 –x4 <10
∀xi > 0
Step by Step Solution
3.46 Rating (166 Votes )
There are 3 Steps involved in it
Step: 1
Problem is Max Z 36 x1 30 x2 3 x3 4 x4 subject to x1 x2 x3 5 6 x1 5 x2 x4 10 and x1x2x3x40 The probl...
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Introduction to Operations Research
Authors: Frederick S. Hillier, Gerald J. Lieberman
10th edition
978-0072535105, 72535105, 978-1259162985
