1 / 62

Management Science – MNG221

Management Science – MNG221. Linear Programming – The Simplex Method. The Simplex Method. The Simplex Method , is a general mathematical solution technique for solving linear programming problems.

Management Science – MNG221

An Image/Link below is provided (as is) to download presentation Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

1. Management Science – MNG221 Linear Programming – The Simplex Method

2. The Simplex Method • The Simplex Method, is a general mathematical solution technique for solving linear programming problems. • The model is put into the form of a table, and then a number of mathematical steps are performed on the table. • It replicatesthe process in graphical analysis of moving from one extreme point on the solution boundary to another.

3. The Simplex Method • Unlike the graphical method, in which we could simply search through all the solution points to find the best one, the simplex method moves from one better solution to another until the best one is found, and then it stops. • The first step in solving a linear programming model manually with the simplex method is to convert the model into standard form

4. Maximization Problem: Simplex Procedure Step 1: Define the decision variables x1 – number of bowls x2 – number of mugs Step 2: Define the objective function Z = 40 x1 + 50x2 Step 3: Define the constraints x1 + 2x2 ≤ 40 4x1 + 3x2 ≤ 120 Non-negativity constraints x1 ,x2 ≥ 0 Step 4: Solve the problem There are 40 labour hours and 120 pounds of clay available

5. The Simplex Method • We convert this model into standard form by adding slack variables to each constraint as follows. MaximizeZ = 40 x1 + 50x2 + 0s1 + 0s2 Where x1 + 2x2 + s1 = 40 4x1 + 3x2 + s2 = 120 x1 ,x2, s1, s2≥ 0 • The slack variables, s1 and s2, represent the amount of unused labor and clay, respectively.

6. The Simplex Method • Slack variables are added to constraints and represent unused resources. • If no bowls and mugs are produced, and x1 = 0 and x2 = 0, then the solution to the problem is: x1 + 2x2 + s1 = 40 0 + 2(0) + s1 = 40 s1= 40 hrs of Labour and 4x1+ 3x2 + s2 =120 4(0) + 3(0) + s2 = 120 s2 = 120 lbs of clay

7. The Simplex Method • Since unused resources contribute nothing to profit, the profit is zero. Z = \$40x1+ 50x2 + 0s1 + 0s2 Z = 40(0) + 50(0) + 0(40) + 0(120) Z = \$0 • It is at this point that we begin to apply the simplex method with the inequality constraints converted to equations for solution .

8. The Simplex Method –The Solution of Simultaneous Equations • The equations should be solved simultaneously to determine the values of the variables at every possible solution point. • Our Example problem has two equations and four unknowns (i.e., two decision variables and two slack variables) • This situation makes direct simultaneous solution impossible.

9. The Simplex Method –The Solution of Simultaneous Equations • The simplex method alleviates this problem by assigning some of the variables a value of zero. • The number of variables assigned values of zero is n - m, where: n = the number of variables m = the number of constraints (excluding the non-negativity constraints). n = 4 variables & m = 2 constraints; • Therefore, two of the variables are assigned a value of zero (i.e., 4 - 2 = 2).

10. The Simplex Method –The Solution of Simultaneous Equations • For example, letting x1 = 0 and s1 = 0 results in the following set of equations: x1 + 2x2 + s1 = 40 4x1 + 3x2 + s2 =120 and 0+ 2x2 + 0= 40 4(0) + 3x2 + s2 =120 • First, solve for x2 in the first equation: 2x2 = 40 x2= 20

11. The Simplex Method –The Solution of Simultaneous Equations • Then, solve for s2 in the second equation: 3x2 + s2 =120 3(20) + s2 =120 s2 =60 At point A, x1 = 0, x2= 20, s1 = 0, and s2 = 60, is the solution obtained by solving simultaneous Equations and is referred to as a basic feasible solution

12. The Simplex Method –The Solution of Simultaneous Equations • A basic feasible solution satisfies the model constraints and has the same number of variables with non-negative values as there are constraints. • Consider a second example where x2 = 0 and s2 = 0 x1 + 2x2 + s1 = 40 4x1 + 3x2 + s2 =120 and x1 + 2(0) + s1 = 40 4x1 + 3(0) + 0=120

13. The Simplex Method –The Solution of Simultaneous Equations • First, Solve for x1 4x1 + 3(0) + 0=120 4x1 =120 x1 =30 • Then solve for s1 x1 + 2(0) + s1 = 40 30 + s1 = 40 s1 = 10 • This basic feasible solution corresponds to point Cwhere x1 = 30, x2 = 0, s1 = 10, and s2 = 0.

14. The Simplex Method –The Solution of Simultaneous Equations • Consider another example where s1 = 0 and s2 = 0 x1+ 2x2 + s1 = 40 4x1+ 3x2 + s2 =120 and x1 + 2x2 + 0= 40 4x1 + 3x2 + 0=120 • The equations can be solved using Row Operations • Row Operations are used to solve simultaneous equations where equations are multiplied by constants and added or subtracted from each other.

15. The Simplex Method –The Solution of Simultaneous Equations • First, multiply the 1stequation by 4 to get 4x1+ 8x2 = 160 • Then subtract the 2nd equation from the 1st : 4x1+ 8x2 = 160 - 4x1 - 3x2= -120 5x2= 40 x2= 8 • Next, sub. this value of x2 into either one of the constraints. x1+ 2(8) = 40 x1 = 24 • This solution corresponds to point B on the graph, where x1 = 24, x2 = 8, s1 = 0, and s2 = 0, which is the optimal solution point.

16. The Simplex Method –The Solution of Simultaneous Equations • All three of these example solutions meet our definition of basic feasible solutions. • However, two specific questions are raised by the identification of these solutions. • In each example, how was it known which variables to set equal to zero? • How is the optimal solution identified? • The simplex method is a set of mathematical steps that determines at each step which variables should equal zero and when an optimal solution has been reached.

17. LINEAR PROGRAMMING The Simplex Method

18. The Simplex Method • The steps of the simplex method are carried out within the framework of a table, or tableau. • The tableau organizes the model into a form that makes applying the mathematical steps easier. • The simplex method is a set of mathematical steps for solving a linear programming problem carried out in a table called a simplex tableau.

19. The Simplex Method • The Beaver Creek Pottery Company example Maximize Z = 40 x1 + 50x2 + 0s1 + 0s2 Subject to x1 + 2x2 + s1 = 40 4x1 + 3x2 + s2 = 120 x1 ,x2, s1, s2 ≥ 0

20. The Simplex Method This is the initial simplex tableau for this model, with the various column and row headings

21. The Simplex Method • Cj Row – The Coefficients of the Objective Function • Cj Column –Contribution to Profit of Basic Feasible Solution • Basic Variables Column – Basic Feasible Solution Variables • Quantity Column – Quantity of Basic Feasible Solution • Zj Row – Profit • Cj–Zj Row – Contribution to Profit • X1, X2, S1, and S2Columns – Decision Variables and Slack Variables

22. The Simplex Method • The first step in filling the table is to record the model variables along the second row from the top. • The two decision variables are listed first, in order of their subscript magnitude, followed by the slack variables, also listed in order of their subscript magnitude. x1, x2, s1, and s2

23. The Simplex Method • The next step is to determine a basic feasible solution • The basic feasible solution in the initial simplex tableau is the origin where all decision variables equal zero. • The Simplex Method, instead of arbitrarily selecting a point, selects the origin as the initial basic feasible solution because the values of the decision variables at the origin are always known in all linear programming problems. • At that point x1 = 0 and x2 = 0;

24. The Simplex Method • Thus, the variables in the basic feasible solution are s1 and s2.x1+ 2x2 + s1 = 40 0 + 2(0) + s1 = 40 s1 = 40hr And 4x1 + 3x2 + s2 =120 4(0) + 3(0) + s2= 120 s2= 120lb • In other words, at the origin, where there is no production, all resources are slack, or unused.

25. The Simplex Method • In other words, at the origin, where there is no production, all resources are slack, or unused. • At the initial basic feasible solution at the origin, only slack variables have a value greater than zero. • The quantity column values are the solution values for the variables in the basic feasible solution.

26. The Simplex Method • The top two rows and bottom two rows are standard for all tableaus; • However, the number of middle rows is equivalent to the number of constraints in the model. • This is because the n variables minus m constraints equals the number of variables with values of zero. • Therefore, it has two middle rows corresponding to s1 and s2 in the initial solution. • The number of columns in a tableau is equal to the number of variables (including slacks, etc.) plus three.

27. The Simplex Method • The next step is to fill in the cj values, which are the objective function coefficients, representing the contribution to profit (or cost) for each variable xj or sj in the objective function, that is 40, 50, 0, and 0 are inserted. • The values for Cj Column are the contributions to profit of only those variables in the basic feasible solution, in this case s1 and s2

28. The Simplex Method • The columns under each variable (i.e., x1, x2, s1, and s2) are filled in with the coefficients of the decision variables and slack variables in the model constraint equations. • That is the s1row represents the 1st constraint; the coefficient for x1=1, x2= 2, s1= 1, s2= 0. The s2row are the 2ndconstraint equation coefficients, 4, 3, 0, and 1.

29. The Simplex Method • Steps of the simplex method (maximization model): • First, transform all inequalities to equations by adding slack variables. • Develop a simplex tableau with the number of columns equaling the number of variables plus three, and the number of rows equaling the number of constraints plus four. • Set up table headings that list the model decision variables and slack variables. • Insert the initial basic feasible solution, which are the slack variables and their quantity values. • Assign cj values for the model variables in the top row and the basic feasible solution variables on the left side. • Insert the model constraint coefficients into the body of the table.

30. LINEAR PROGRAMMING Computing the zj and cj - zj Rows The Simplex Method

31. The Simplex Method- Computing the zj and cj - zj Rows - • The values in the zj row are computed by multiplying each cj column value (on the left side) by each column value under Quantity, x1, x2, s1, and s2 and then summing each of these sets of values.

32. The Simplex Method- Computing the zj and cj - zj Rows - • For example, the value in the zj row under the quantity column is found as follows. Cj x Qty 0 x 40 = 0 0 x 120 = 0 Zj= 0 • The value in the zj row under the x1 column is found similarly. Cj x X1 0 x 1 = 0 0 x 2 = 0 Zj= 0

33. The Simplex Method- Computing the zj and cj - zj Rows - • Now the cj-zj row is computed by subtracting the zj row values from the cj (top) row values. • For example, in the x1 column the cj-zjrow value is computed as 40-0 = 40.

34. The Simplex Method- Computing the zj and cj - zj Rows - • This tableau represents the solution at the origin, where x1 = 0, x2 = 0, s1 = 40, and s2 = 120. • This solution is obviously not optimal because no profit is being made. • Thus, we want to move to a solution point that will give a better solution. • In other words, we want to produce either some bowls (x1) or some mugs (x2). • One of the nonbasic variables (i.e., variables not in the present basic feasible solution) will enter the solution and become basic.

35. LINEAR PROGRAMMING The Entering Non-basic Variable The Simplex Method

36. The Simplex Method- The Entering Non-basic Variable - • The variable with the largest positive cj-zjvalue is The Entering Variable. • The cj-zjrow values represent the net increase per unit of entering a nonbasic variable into the basic solution. • Because the objective is to maximize profit we enter the variable that will give the greatest net increase in profit per unit. • We select variable x2as the entering basic variable because it has the greatest net increase in profit per unit, \$50 the highest positive value in the cj-zjrow.

37. The Simplex Method- The Entering Non-basic Variable - • At the origin nothing is produced. • In the simplex method we move from one solution point to an adjacent point • That is one variable in the basic feasible solution is replaced with a variable that was previously zero. • We can move along either the x1 axis or the x2 axis in order to seek a better solution. • Because an increase in x2 will result in a greater profit, we choose x2.

38. The Simplex Method- The Entering Non-basic Variable - • The x2 column, highlighted, is referred to as the pivot column. • The pivot column is the column corresponding to the entering variable.

39. LINEAR PROGRAMMING The Leaving Basic Variable The Simplex Method

40. The Simplex Method- The Leaving Basic Variable - • Since each basic feasible solution contains only two variables with nonzero values, • One of the two basic variables present, s1 or s2, will have to leave the solution and become zero. • Since we have decided to produce mugs (x2), we want to produce as many as possible or, in other words, as many as our resources will allow.

41. The Simplex Method- The Leaving Basic Variable - • First, in the labor constraint we will use all the labor to make mugs (because no bowls are to be produced, x1 = 0; and because we will use all the labor possible and s1 = unused labor resources, s1 = 0 also). 1x1+ 2x2 + s1 = 40hr 1(0) + 2x2 + 0= 40hr x2 = 40hr 2hr/mug = 20mugs • In other words, enough labor is available to produce 20 mugs.

42. The Simplex Method- The Leaving Basic Variable - • Next, perform the same analysis on the constraint for clay. 4x1+ 3x2 + s2 =120lbs 4(0) + 3x2 + 0=120lbs x2 =120lbs 3 lbs/mug x2 =40 mugs

43. The Simplex Method- The Leaving Basic Variable - • This indicates that there is enough clay to produce 40 mugs. But there is enough labor to produce only 20 mugs. • We are limited to the production of only 20 mugs because there is not enough labor for more mugs. • Moving out the x2 axis, we can move from the origin to either point A or point R. • Point A is selected because it is the most constrained and thus feasible, whereas point R is infeasible.

44. The Simplex Method- The Leaving Basic Variable - • This analysis is performed in the simplex method by dividing the quantity values of the basic solution variables by the pivot column values. For this tableau, • The leaving variable is determined by dividing the quantity values by the pivot column values and selecting the minimum possible value or zero.

45. The Simplex Method- The Leaving Basic Variable - • The s1 row, highlighted is referred to as the pivot row. • The pivot row is the row corresponding to the leaving variable. • The pivot number is the number at the intersection of the pivot column and row.

46. LINEAR PROGRAMMING Developing a New Tableau The Simplex Method

47. The Simplex Method- Developing The New Tableau - • The initial new simplex tableau with the new basic feasible solution variables of x2 and s2 and their corresponding cjvalues is as follows.

48. The Simplex Method- Developing The New Tableau - • The various row values in the second tableau are computed using several simplex formulas. • First, the x2 row, called the new tableau pivot row, is computed by dividing every value in the pivot row of the first (old) tableau by the pivot number. • Formula

49. The Simplex Method- Developing The New Tableau - • To compute all remaining row values (in this case there is only one other row), another formula is used. • Formula

50. The Simplex Method- Developing The New Tableau - • Table Computations

More Related