Scribd
Upload
3 views2 pages

Tutorial 8

The document outlines a tutorial on the Dual Simplex Method in Applied Linear Programming, providing various optimization problems to solve. It includes the use of Karmarkar’s algorithm for a minimization problem and multiple applications of the dual simplex method for different scenarios, with some resulting in infeasible solutions. Key solutions and optimal values are presented for each problem.

Uploaded by

sahithikrishnasss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Tutorial 8

The document outlines a tutorial on the Dual Simplex Method in Applied Linear Programming, providing various optimization problems to solve. It includes the use of Karmarkar’s algorithm for a minimization problem and multiple applications of the dual simplex method for different scenarios, with some resulting in infeasible solutions. Key solutions and optimal values are presented for each problem.

Uploaded by

sahithikrishnasss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MA-222 Applied Linear Programming

Tutorial 8: Dual Simplex Method

1. Use Karmarkar’s algorithm to solve the first iteration of the following problem:
Minimize f (x) = x1 + 3x2 − 3x3
Subject to
x2 − x3 = 0
x1 + x2 + x3 = 1
x1 , x2 , x3 ≥ 0.
7 10 10 T
Solution : x1 = ( 27 , 27 , 27 ) .
2. Solve the following questions using dual simplex method:
Minimize f (x) = 3x1 + x2
Subject to
x1 + x2 ≥ 1
2x1 + 3x2 ≥ 2
x1 , x2 ≥ 0.
Solution : (0, 1) and optimal value is 1.
3. Solve the following questions using dual simplex method:
Maximize f (x) = −2x1 − x2
Subject to
2x1 + x2 ≤7
3x1 + 2x2 ≥ 16
x1 + 2x2 ≥5
x1 , x2 ≥ 0.
Solution : Infeasible solution.
4. Solve the following questions using dual simplex method:
Minimize f (x) = 20x1 + 16x2
Subject to
x1 + 3x2 ≤ 17
2x1 + x2 =6
x1 + x2 ≥ 12
x1 , x2 ≥ 0.
Solution : Infeasible solution.

Page 2

You might also like