Math Problem Statement
Consider the problem min z=10x1 + 8x_{2},s.t.c: x_{1} + 2x_{2} >= b_{1} 2x_{1} - x_{2} >= b_{2} x_{1} + 3x_{2} >= b_{3}where b1,b2,b3 are constants.For specific values of b1, b2, b3. The optimal solutio isIs To y_{7} y_{8} Saln.
Basic
y
0
Yé y." Y3 y_{11}
Ys
0
1715-15-1-15
45
1-
a
- 2/5 1/5 0
45
Y2"
y_{1}
oe
0
C-215 0 y_{5} 2/5 0 29/5
z_{j} - c_{j}
where a,b,c,d, e are constants. Determine
(1) The values of bi, be, by that yield the givenoptimal soln
(ii) the optimal dual soln &
(iii) the values of a, b & e in the optimal tableare.
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Linear Programming
Simplex Method
Dual Problem
Formulas
Objective Function: z = 10x1 + 8x2
Simplex Tableau
Theorems
Fundamental Theorem of Linear Programming
Duality Theorem
Suitable Grade Level
Undergraduate
Related Recommendation
Linear Programming Optimization Problem with Simplex Method and Duality
Linear Programming Simplex Method: Maximize z = 5x1 + 4x2
Solve Linear Programming Problem Using Simplex Method: Maximize Z = x1 + 2x2 + x3
Maximize z = 9x1 + 3x2 with Constraints Using Simplex Method
Solve Linear Programming Problem using the Simplex Method: Max z = 100x + 80y