Download presentation

Presentation is loading. Please wait.

1
Hillier and Lieberman Chapter 4

2
**The Essence of the Simplex**

It is an algebraic procedure Wyndor glass example Constraint boundaries, figure 4.1

3
**Wyndor Glass Maximize Z = 3X1 + 5X2 Subject to: X1 ≤ 4 2X2 ≤ 12**

4
**Figure 4.1 Corners: (0,0) (4,0) (4.3) (2,6) and (0,6) 2, 6 0, 6 4,3**

5
**Corner Point Feasible Solutions**

Corner point feasible solutions (CPF solutions) occur at the intersections of the constraint boundaries, which are in the feasible region. The problem has 2 decision variables, so each corner occurs at the intersection of two constraints. The dimension of the problem determines the number of constraints that intersect at each corner. If there are, for example, 5 decision variables the corner points occur at the intersection of 5 constraints.

6
**Adjacent feasible solutions**

For any linear programming model with n decision variables, two CPF solutions are adjacent to each other if they share n-1 constraints. The two adjacent CPF solutions are connected by a line segment that lies on the same shared constraint boundaries. Such a constraint boundary is referred to as an edge of the feasible region.

7
**Figure 4.1 (0,0) and (0,6) adjacent (0,6) and (2,6) adjacent**

There are 5 edges. From each CPF solution, 2 edges emanate. Each CPF solution has 2 adjacent solutions. 2, 6 0, 6 4,3 4,0 0,0

8
**Optimality test If a CPF solution has no adjacent CPF**

solution that is better (in terms of the value of the objective function) then it must be an optimal solution.

9
Solving the example Initialization. Choose point (0,0) because it is convenient (no calculation needed to show it is feasible) Optimality test: Conclude that (0,0) is not optimal because adjacent CPF solutions are better Iteration 1: Move to a better CPF solution

10
Simplex Iteration Consider the two edges that emanate from (0,0). Move up the X2 axis because X2 contributes more to the objective function of Z = 3X1 + 5X2. Stop at the next constraint boundary, 2X2 = 12 (or X2 = 6). This is point (0,6). You can’t move further in this direction without leaving the feasible region. Find the other adjacent CPF solution for this point (2,6) from the intersection of constraints. Optimality test: (0,6) is not optimal because (2,6) is better. Repeat steps. (2,6) is optimal solution.

11
**Solution Concepts Simplex focuses only on CPF solutions, a finite set.**

It is an iterative procedure, meaning a fixed series of steps is repeated (an iteration) until a desired result is found. When possible, the initial CPF solution is the origin because it is convenient. (Possible when all variables are non-negative.) If origin is infeasible, special procedures are needed, described in section 4.6 of this chapter.

12
**Solution Concepts, Continued**

At each iteration, we always choose an adjacent CPF solution. Steps take place along the edges of the feasible region. To find the next CPF solution to test, the algorithm computes the rate of improvement in that direction. A positive rate of improvement implies that the adjacent CPF solution is better than the current one. So we test whether any of the edges have a positive rate of improvement.

13
**Setting up the Simplex Method**

We convert the inequalities to equalities by use of slack variables (and artificial variables for GE constraints). Let X3 be a slack for the first constraint X1 ≤ 4 becomes X1 + X3 = 4 With X3 ≥ 0

14
**Wyndor Glass: Augmented Form**

Maximize Z = 3X1 + 5X2 Subject to: X1 + X3 = 4 2X X = 12 3X1 + 2X X5 = 18 all X variables non-negative

15
**Augmented Solution The augmented solution contains values for**

the decision variables AND values for the slacks. So if we augment the solution (3, 2) in this example by the values of the slacks we get (3, 2, 1, 8, 5). A basic solution is an augmented corner-point solution.

16
**Properties of a basic solution**

Each variable is either basic or non-basic The number of basic variables equals the number of functional constraints. The number of non-basic variables equals the total number of variables minus the number of functional constraints. The non-basic variables are set equal to zero. The values of the basic variables are found by solving the simultaneous equation system. If the basic solution satisfies the non-negativity consideration, it is called a basic feasible solution.

17
**Example: BF Solution X1 + X3 = 4 2X2 +X4 = 12 3X1 + 2X2 +X5 = 18**

Set X1 and X4 = 0 (non-basic). From first constraint, X3 =4. From second constraint, X2 = 6. From third constraint, X5 =6. (0, 6, 4, 0, 6)

18
**Test for adjacent points**

Two BF solutions are adjacent if all but one of their non-basic variables are the same. All but one of the basic variables would correspond in the two points, but perhaps with different values. Moving to an adjacent point means we swap one basic variable for a non-basic one. One variable enters; the other leaves.

19
**Algebra of the Simplex Initialization: X1 = 0 and X2 = 0**

Yields: X3 = 4, X4 = 12, and X5 = 18 BFS (0, 0, 4, 12, 18) X1(0) X3 = 4 2X2(0) X4 =12 3X1(0) + 2X2(0) X5 = 18 Notice that the BFS can be read immediately from RHS. The simplex used a procedure (Gaussian elimination) to convert the equations to the same convenient form with each iteration.

20
**Geometric Algebraic Choose (0,0) as initial CPF solution.**

Optimality test: not optimal because moving along either edge increases Z. Iteration 1, step 1: Move up the edge lying on the X2 axis. Choose X1and X2 to be non-basic for initial BFS (0,0,4,12,18) Not optimal because increasing either non-basic variable increases Z. Iteration 1, step 1: Increase X2 while adjusting other variable values to satisfy the system of equations.

21
Geometric Algebraic Iteration 1, step 2; Stop when the first new constraint boundary (X2=6) is reached. Iteration 1, step 3: Find the intersection of the new pair of constraint boundaries: (0,6) is the new CPF solution. Iteration 1, step 2: Stop when the first basic variable (X3, X4, or X5) drops to zero. Iteration 1, step 3. With X2 now basic and X4 non-basic, solve the system of equations to find the new BFS (0,6,4,0,6)

22
Geometric Algebraic Optimality test: Not optimal because moving along the edge from (0,6) to the right increases Z. Iteration 2: Move along the edge to the right and stop when the new constraint boundary is reached. Optimality test : (optimal) Optimality test: Not optimal because increasing one non-basic variable (X1) increases Z. Iteration 2: Increase X1, while adjusting other variables and stop when the first basic variable reaches 0. Optimality test: (optimal)

23
**Direction of Movement Z = 3X1 + 5X2**

If we increase X1 rate of improvement is 3. If we increase X2 rate of improvement is 5. Choose X2. X2 is the entering basic variable for iteration 1.

24
**Where to stop Increasing X2 increases Z. We want to go as**

far as possible without leaving the feasible region. Check the constraints. X3 = 4 ≥ 0 No upper bound on X2 X4 = 12 – 2X2 ≥ 0 X2 ≤ 6 to keep X4 non-neg X5 = 18 – 2X2 ≥ 0 X2 ≤ 9 to keep X5 non-neg Thus, X2 can be increased to 6, at which point X4 drops to zero (non-basic). This is the minimum ratio test.

25
**Minimum Ratio Test The objective of the test is to determine which**

currently basic variable will drop to zero and become non-basic. We can rule out the basic variable in any equation where the coefficient of the entering variable is zero or negative since such a basic feasible variable would not decrease as the entering variable increases.

26
**Our Pivot Using Matrix Algebra**

We found the largest entry in the Objective row (greatest increase in Z). The variable in that column was the entering variable. We did the minimum ratio test by dividing the RHS entries by the positive entries in the column. The current basic variable is determined by this equation.

27
Solving for the new BFS Step 3 of the iteration is finding the new BFS. We know that X1=0, X2=6, and X4=0. We need to solve for X3 and X5. Z – 3X1 – 5X2 = 0 X X3 =4 2X X = 12 3X1 +2X X = 18 Current coefficients on X4 are (0,0,1,0). We want to make this the pattern of coefficients for X2.

28
**Solving for new BF Solution, Continued**

To get the desired pattern of coefficients for X2, we use matrix algebra. Multiple or divide by a non-zero constant. Add or subtract multiples of one equation from another. The current coefficients on X2 are (-5,0,2,3) and we want them to be (0,0,1,0)

29
**Transformed Equations**

Z - 3X /2X4 = 30 X X = 4 X ½ X4 = 6 3X X X = 6 Since X1 = 0 and X4 = 0, the equations in this form give the BFS (0, 6, 4, 0, 6)

30
**Optimality test for new BF solution**

The current objective function gives the value of Z in terms of only the current nonbasic variables. Z = X1 – 5/2 X4 If X1 increases, Z will increase. In iteration 2, we let X1 enter and find a variable to leave. Or minimum ratio test indicates X5 will leave. We repeat the algebraic manipulations to reproduce the pattern of coefficients for X5 (0,0,0,1) as the new coefficients of X1.

31
**Tabular form We have done the tabular form already**

It provides a summary of important information The simplex tableau is a compact display of the system of equations

32
**Simplex Tableau Optimality test: The current BFS is optimal if**

every coefficient in Obj row is non-negative. Otherwise pivot to obtain a new tableau.

33
Pivots

34
Section 4.5 Tie Breaking Tie for entering variable: If two variables are tied for largest negative value in obj row, pick one arbitrarily. No problems should result. Tie for leaving basic variable (degeneracy). This is a tie for the minimum ratio. Whichever variable is picked to leave, the other variable will also be driven to zero in the pivot. Problems may ensue.

35
**Degeneracy If one of the degenerate basic variables (basic**

variables with a value of zero) retains its zero value until it is chosen at a subsequent iteration to be the leaving basic variable, the corresponding entering variable will be stuck at zero since it can’t be increased without making the degenerate leaving variable negative, so the value of Z won’t change. Simplex may go around in a loop, repeating the same sequence without advancing.

36
**Degeneracy, continued Perpetual loops are rare. When they do**

occur, you can get out of it by picking a different leaving basic variable from the tie. Special rules have been developed for tie breaking so that the loops are avoided. See: R. Bland “New Finite Pivoting Rules for the Simplex Method.” Mathematics of Operations Research, 2: , 1977.

37
**Unbounded Z If Z is unbounded, there will be no candidate**

for the leaving basic variable. In these cases, the constraints don’t keep the value of the objective function from increasing indefinitely.

38
**Multiple Optimal Solutions**

In this case, the objective function has the same slope as one of the constraints. If we change the objective function for the Wyndor glass problem to: Z = 3X1 + 2X2 The new objective function has the same coefficients as the third constraint. The simplex stops after one optimal solution is found.

39
**How to tell if there are more optimal solutions**

It may be desirable to identify other optimal solutions. Some programs tell you they exist. Whenever a problem has more than one optimal BFS, at least one of the non-basic variables will have a coefficient of zero in the final objective function. Other solutions can be found by pivoting and using the variable with the zero coefficient in the objective row as the entering variable.

40
**Multiple Optimal Solutions**

41
**Section 4.6 Other Model Forms**

Equality Constraints Negative Right Hand Sides Functional Constraints in ≥ form Minimization problems

42
**An Equality Constraint**

As we saw in McCarl and Spreen an equality constraint is equivalent to two inequality constraints. Hillier and Lieberman provide another way to handle these constraints, with an artificial variable.

43
**Modified Problem Change the last constraint so that 3X1 + 2X2 = 18**

Z - 3X1 – 5X2 = 0 X X3 = 4 2X2 + X4 = 12 3X1 + 2X2 = 18 There is no obvious BFS because there is no slack in the third constraint.

44
Figure 4.3 The BFS is now a line between the two points. 2, 6 4,3

45
**Use an artificial variable**

Z - 3X1 – 5X2 +MX5 = 0 X X3 = 4 2X2 + X4 = 12 3X1 + 2X X5 = 18 X5= 18 – 3x1 – 2X2 The large M ensures that the artificial variable will be driven to zero.

46
**Negative RHS To eliminate the negative value in the**

RHS, multiply through by -1. This operation reverses the sign of the equality. In doing simplex by hand, all RHS variables must be positive. Not required for computer algorithms.

47
**Functional Constraints as ≥**

We introduce both a surplus variable and an artificial variable so that we can have a BFS. (We used this technique in solving our minimization problems earlier.) Here we will look at an alternative method to solving minimization problems, the two phase method.

48
Minimization Minimize Z = ∑jcjXj Same as Maximize -Z= ∑j (-cj)Xj

49
Radiation Example Minimize Z = 0.4X X2 where X1 and X2 represent doses of two beams 0.3X X2 ≤ 2.7 0.5X X2 = 6 0.6X X2 ≥ 6 2nd and 3rd constraint will require artificial variables. 1st constraint takes a slack and third takes a surplus

50
**Problem -Z + 0.4X1 + 0.5X2 +MX4 + MX6 0.3X1 + 0.1X2 +X3 = 27**

X3 is a slack variable X4 and X6 are artificial variables X5 is a surplus variable

51
Two-Phase Method Initialization: Add artificial variables to get an obvious initial solution for the artificial problem. The objective of this phase is to find a BFS to the real problem. We minimize the artificial problem.

52
**The artificial problem**

Minimize Z = X X6 0.3X X2 +X = 27 0.5X X X = 6 0.6X X X5 + X6 = 6

53
**The Real Problem Minimize Z = 0.4X1 + 0.5X2 0.3X1 + 0.1X2 +X3 = 27**

54
**Phase 1: Obtain the starting objective**

Min Z = X X6 becomes Max -Z = – X4 – X6 Use elementary row operations to zero these out. (E.g. add or subtract multiples of the other rows until the coefficients on X4 and X6 are zero. That gives us –Z -1.1X X2 +X5 = -12 We perform the usual simplex maximization and find a BFS (6,6,0,3,0,0,0)

55
**Phase 1: Obtain the starting objective**

Min Z = X X6 becomes Max -Z = – X4 – X6 Use elementary row operations to zero these out. (E.g. add or subtract multiples of the other rows until the coefficients on X4 and X6 are zero. That gives us –Z -1.1X X2 +X5 = -12 We perform the usual simplex maximization and find a BFS (6,6,0,3,0,0,0)

56
Phase 1

57
**Phase 2 Start from the final tableau of phase 1**

Drop the artificial variables Substitute the phase 2 objective function Restore proper form by eliminating the basic variables X1 and X2 from the objective row (use row operations) Solve the phase 2 problem

58
**Phase 2 Optimal Solution: X1 = 7.5, X2 = 4.5, X3 (slack)=0,**

X5 (surplus) = 0.3

59
No Feasible Solutions Artificial variable method can construct a BFS when an obvious one is not available. Using either the big M method or the two phase method allows simplex to work. Possible pitfall: There may be no feasible solutions to the real problem, but by constructing artificial variables we may allow the simplex to proceed and report an “optimal solution” When this happens, one of the artificial variables will have a positive value in the final solution.

60
**Variables allowed to be negative**

We’ve dealt with this in McCarl and Spreen. Two types, one is bounded, one unbounded. X1 ≥ construct X1* = X and substitute X1 can take any value. X1 = X1(+) and X1(-) adds an extra column to the problem.

61
**Section 4.7 Post-Optimality Analysis**

Re-optimization Shadow prices (we’ve covered) Sensitivity analysis Parametric programming

62
**Re-optimization If we have found an optimal solution for one**

version of an LP and then want to run a slightly different version, it is inefficient to start from scratch. Re-optimization involves deducing how changes in the original model get carried into the final solution (our original optimal solution). The final tableau is then revised in light of the new information and the iterations start from there. (If the tableau that emerges is not feasible, a dual method can be applied. )

63
**Sensitivity Analysis Sensitivity parameters are those that can’t be**

changed without changing the optimal solution. If a shadow price on a constraint is positive, then an increase in the RHS of that constraint will change the optimal solution. If it is zero, there is a range over which it can be changed with no change in the optimal solution. Also, if a reduced cost is non-zero, there will be a range over which the related Cj can be changed without affecting the solution.

64
**Parametric Programming**

Related to sensitivity analysis Involves the systematic study of how the optimal solution changes as many parameters change simultaneously over some range Trade-offs in parameter values can be studied, e.g. some resources (bi) can be increased if others are reduced

65
**Section 4.9 Interior Point Solution**

Starts from inside the feasible region Moves along a path from the interior to the boundary Large problems can be solved more efficiently

Similar presentations

OK

The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.

The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on stress management for students Ppt on mpeg video compression Ppt on self awareness and leadership Ppt on brain and spinal cord Ppt on wireless communication network Ppt on smart note taker Ppt on bmc remedy help Ppt on type 2 diabetes facts Ppt on web content management system Ppt on id ego superego image