Duality and Sensitivity in Linear Programming

Every linear programming problem, whether of maximization or minimization, is associated with another linear programming problem based on the same data.

The original problem in this context is called the primal problem, whereas the other is called its dual problem.

The formulation of the dual linear programming is sometimes referred to as duality.

8/3/12

1 1

The Primal-Dual construction relationship The number of constraints in the primal problem is equal the number of dual variables, and vice versa. to

If the primal problem is a maximization problem, then the dual problem is a minimization problem and vice versa. If the primal problem has greater than or equal to type constraints, then the dual problem has less than or equal to type constraints and vice versa. The profit coefficients of the primal problem appear on the right-hand side of the dual problem. The rows in the primal become columns in the dual and vice versa. At the optimum solution, Objective value in = Objective value in
for both problems

8/3/12 maximization problem

minimization problem

2 2

Schematic for the Primal-Dual construction

8/3/12

3 3

Primal Max. z= 20x1 + 24 x2 Subject to: 2x1 + 3x2 1500 (burning) 3x1 + 2x2 1499 (glazing) Dux1 + x2 600 (molding) (contract) al x2 250 x1 , x2 0 (non-negative)

Min. w = 1500 y1 + 1499 y2 +600 y3 + 250 y4

8/3/12 4 4

Optimum Tableaux Primal Basic Z s1 x1 x2 s1 0 0 0 0 0 s2 s3 0 0 s4 b

20/ 3 1 -2/3

32/3 1266 0 -5/3 84

Dual

x1 Basic s3 w x2 y2

1 0 0 y4 0 y1 y2 y3 1/3 s1 -2/3 333 s2 b 0 -84 0 2/3 0 0 1 1 0 1 -1/3 17 -17 -1/3 -333 -250 1266 0 0 0 0 1/3 0 -1/3 1 20/3 0 0 250
5 5

8/3/12

Dual simplex method

(equations in standard form) w - 1500 y1 - 1499 y2 - 600 y3 - 250y4 =0 Subject to: - 2y1 - 3y2 - y3

+s1

= - 20

Multiply the eqs. with (-1)

Basic w

- 3y1 - 2y2 - y3 - y4 with +ve sign

y1 y2 y3 y4 s1 0 1500 1499 600 250 1 0

+ s2 = - 24to bring surplus variables

s2 0

b 0 K e y r o w
6 6

s1 -2 -3 -1 0 s2 -3 -2 -1 -1 Ratio Key 250 w / key 500 749. 600 col 5 row 8/3/12 um

ey K e El e m nt

0 1

-20 -24

Postoptimal or Sensitivity Analysis In linear programming, all model parameters are assumed to be constant; but in real life situations, the decision environment is always dynamic.

Therefore, it is important for the management to know how profit would be affected by; an increase or decrease in the resource level, a change in the technological process, and a change in the cost of raw materials.

Such an investigation is known as sensitivity analysis or post- optimality analysis. The main goal of the management is to know how sensitive the solution is to the original data.

8/3/12

7 7

Change in white boxes is Sensitivity analysis.

8/3/12

8 8