1. Sindhuja K, Annapoorani G, Pramela Devi S Department: CSE
Subject Name:
OPERATIONS RESEARCH
Subject Code:
10CS661
Prepared By:
Sindhuja K, Annapoorani G,
Pramela Devi S
Department:
CSE
11/17/2018

2. UNIT V- Duality Theory,Sensitivity Analysis
11/17/2018

3. Topics Duality Theory Sensitivity Analysis
The parameteric Linear Programming

4. 1. Duality Theory and Sensitivity Analysis

6. is the
surplus variable for the functional constraints in the dual problem.

7. If a solution for the primal problem and its corresponding solution for the dual problem are both feasible, the value of the objective function is optimal.
If a solution for the primal problem is feasible and the value of the objective function is not optimal (for this example, not maximum), the corresponding dual solution is infeasible.

8. 2.Sensitivity Analysis

12. Case 1 : Changes in bi

14. Incremental analysis

15. The dual simplex method now can be applied to find the new optimal solution.

16. The allowable range of bi to stay feasibleC
The solution remains feasible only if

17. Case 2a : Changes in the coefficients of a nonbasic variable
Consider a particular variable xj (fixed j) that is a nonbaic variable in the optimal solution shown by the final simplex tableau.
is the vector of column j in the matrix A .
We have
for the revised model.
We can observe that the changes lead to a single revised constraint for the dual problem.

18. The allowable range of the coefficient ci of a nonbasic variable

19. Case 2b : Introduction of a new variable

20. Case 3 : Changes in the coefficients of a basic variable

22. The allowable range of the coefficient ci of a basic variable

23. Case 4 : Introduction of a new constraint

24. 3. Parametric Linear Programming
Systematic Changes in the cj Parameters
The objective function of the ordinary linear programming model is
For the case where the parameters are being changed, the objective function of the ordinary linear programming model is replaced by
where q is a parameter and aj are given input constants representing the relative rates at which the coefficients are to be changed.

25. Example:
To illustrate the solution procedure, suppose a1=2 and a2 = -1 for the original Wyndor Glass Co. problem, so that
Beginning with the final simplex tableau for q = 0, we see that its Eq. (0)
If q ≠ 0, we have

26. Because both x1 and x2 are basic variables, they both need to be eliminated algebraically from Eq. (0)
The optimality test says that the current BF solution will remain optimal as long as these coefficients of the nonbasic variables remain nonnegative:

27. Summary of the Parametric Linear Programming Procedure for Systematic Changes the cj Parameters

28. Systematic Changes in the bi Parameters
For the case where the bi parameters change systematically, the one modification made in the original linear programming model is that is replaced by, for i = 1, 2, …, m, where the ai are given input constants. Thus the problem becomes
subject to
The goal is to identify the optimal solution as a function of q

29. Example:
subject to
Suppose that a1=2 and a2 = -1 so that the functional constraints become
This problem with q = 0 has already been solved in the table, so we begin with the final tableau given there.

30. Using the sensitivity procedure, we find that the entries in the right side column of the tableau change to the values given below
Therefore, the two basic variables in this tableau
Remain nonnegative for

31. Summary of the Parametric Linear Programming Procedure for Systematic Changes the bi Parameters