Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester 2008-2009 ITGD4207 University of Palestine.

Slides:



Advertisements
Similar presentations
Artificial Variables, 2-Phase and Big M Methods
Advertisements

Chapter 5: Linear Programming: The Simplex Method
Lecture 3 Linear Programming: Tutorial Simplex Method
Operation Research Chapter 3 Simplex Method.
Linear Programming – Simplex Method
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Assignment (6) Simplex Method for solving LP problems with two variables.
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Dr. Sana’a Wafa Al-Sayegh
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
L16 LP part2 Homework Review N design variables, m equations Summary 1.
3.4 Artificial starting solution Page103
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
The Simplex Method: Standard Maximization Problems
Introduction to the Simplex Algorithm Active Learning – Module 3
Operation Research Chapter 3 Simplex Method.
Minimization by Dr. Arshad zaheer
1 5.6 No-Standard Formulations  What do you do if your problem formulation doeshave the Standard Form?  What do you do if your problem formulation does.
Linear Programming (LP)
5.6 Maximization and Minimization with Mixed Problem Constraints
D Nagesh Kumar, IIScOptimization Methods: M3L4 1 Linear Programming Simplex method - II.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 25, 2013.
LINEAR PROGRAMMING SIMPLEX METHOD.
Chapter 3 Linear Programming Methods 高等作業研究 高等作業研究 ( 一 ) Chapter 3 Linear Programming Methods (II)
The Dual Problem: Minimization with problem constraints of the form ≥
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Transportation Problem
Chapter 6 Linear Programming: The Simplex Method
The Two-Phase Simplex Method LI Xiao-lei. Preview When a basic feasible solution is not readily available, the two-phase simplex method may be used as.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Simplex Algorithm.Big M Method
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Chapter 6 Linear Programming: The Simplex Method Section R Review.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: The Simplex Method.
Solving Linear Programming Problems: The Simplex Method
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
OR Perturbation Method (tableau form) (after two iterations, optimal solution obtained) (0+2  1 ) (0+2  2 ) (1+  3 )
Algebraic Simplex Active Learning – Module 4 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology.
1 5.7 Initialization Revisited  :  Motivation: a solution for the transformed system is feasible for the original system if and only if all the. a solution.
Mechanical Engineering Department 1 سورة النحل (78)
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
1 Chapter 4 The Simplex Algorithm PART 2 Prof. Dr. M. Arslan ÖRNEK.
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
Simplex Method for solving LP problems with two variables.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Simplex Method Meeting 5 Course: D Deterministic Optimization Year: 2009.
 LP graphical solution is always associated with a corner point of the solution space.  The transition from the geometric corner point solution to the.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
Artificial Variable Technique (The Big-M Method) ATISH KHADSE.
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Simplex Algorithm.Big M Method
10CS661 OPERATION RESEARCH Engineered for Tomorrow.
The Two-Phase Simplex Method
Chapter 4 Linear Programming: The Simplex Method
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 5. The Duality Theorem
Presentation transcript:

Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine

ITGD4207 Operations Research Chapter 3 Part-3 Linear Programming Graphical and Algebraic Solution

Linear Programming Algebraic Solution Artificial Starting Solution Artificial Variables Big M Method Two-Phase Method

Artificial Starting Solution  When the linear programming problem being considered has constraints of the type  or equality constraints, then a starting basic feasible solution is not readily available, as was the case for the LP problem with only  constraints.  Example (Inspector Assignment Problem)Inspector Assignment Problem Minimize Z = 40 X X 2 Subject to: 5X 1 + 3X 2  45 X 1  8 X 2  10 X 1, X 2  0 -Z + 40X X 2 = 0 (0) 5X 1 + 3X 2 - S 1 = 45 (1) X 1 + S 2 = 8 (2) X 2 + S 3 = 10 (3) X 1, X 2,, S 1, S 2, S 3  0 Notice that setting the slack and surplus variables as the initial basic variables will not provide an initial basic feasible solution (why?)

Artificial Variables  In order to obtain an initial basic feasible solution, artificial variables are introduced. An artificial variable is introduced for each constraint of the form  or =.artificial variable For instance, Equation (1) becomes: 5X 1 + 3X 2 - S 1 +A 1 = 45 (1)  Where A 1 is the artificial variable. This artificial variable plays the role of providing an initial basic variable; however, unlike the slack variables, it does not have any physical meaning and must be driven out of the basic solution. Two methods exist to accomplish this: The Big M and the Two-Phase methods.

Big M Method  A very large negative penalty (represented by -M) is assessed to each artificial variable (assuming objective is maximized). This way, the Simplex Method will tend to force the artificial variable out of the basic solution.  Once the artificial variables leave the solution, an initial basic feasible solution will be obtained. Once this is achieved, the role of the artificial variables has been fulfilled and they can be dropped from the model.  Example (Inspection Problem): -z + 40X X 2 + MA 1 = 0(0) 5X 1 + 3X 2 - S 1 +A 1 = 45 (1) X S 2 = 8 (2) X 2 + S 3 = 10 (3)

Setting up the Objective Function  Since A 1 is a basic variable, its coefficient in the objective function must be zero. To accomplish this, we solve for A 1 in Equation (1) and substitute it in Equation (0). We can also accomplish this by row operations; i.e. we multiply Row 1 by M and subtract it from Row 0.  From (1): A 1 = 45-5X 1 - 3X 2 + S 1 Then Equation (0) (Objective function) becomes: -z + 40X X 2 + M(45-5X 1 - 3X 2 + S 1 ) = 0 -z +(40 -5 M)X 1 +(36- 3M)X 2 + MS 1 = -45M Then the modified problem becomes : -z +(40 -5 M)X 1 +(36- 3M)X 2 + MS 1 = -45M (0) 5X 1 + 3X 2 - S 1 +A 1 = 45 (1) X S 2 = 8 (2) X 2 + S 3 = 10 (3)  We can now solve this problem by using the simplex method

Inspector Allocation Problem Solution Notice that at the end of Iteration 1, we have found a basic feasible solution (why?). Thus, at this point, the artificial variable has accomplished its objective and it can be dropped from the tableau.

Two-Phase Method Another approach to handling the artificial variables  Phase I Consists of finding an initial basic feasible solution to the original problem. For this purpose, an artificial objective function is created which is the sum of all the artificial variables. The artificial objective is then minimized using the Simplex Method. If the minimum value of the artificial problem is zero, then it follows that all of the artificial variables are zero, and an initial basic feasible solution for the original problem has been obtained. Otherwise, a basic feasible solution for the original problem does not exist (the problem has no feasible solutions- referred to as Inconsistent).  Phase II The basic feasible solution found at the end of Phase I is optimized with respect to the original objective function, i.e., the final tableau of Phase I becomes the first tableau for Phase II (the objective row is changed).

Example  Example: Minimize z = -3x 1 + x 2 + x 3 Subject to: x 1 - 2x 2 + x 3  11 -4x 1 + x 2 + 2x 3  3 2x 1 - x 3 = -1 x 1, x 2, x 3  0  The first phase of the two-phase method is given by the problem: Minimize w = A 1 + A 2 Subject to: x 1 - 2x 2 + x 3 + S 1 = 11 (1) -4x 1 + x 2 +2x 3 - S 2 +A 1 = 3 (2) -2x 1 + x 3 + A 2 = 1 (3) x 1, x 2, x 3, S 1, S 2, A 1, A 2  0 (Note A 1, A 2 are solely for the purpose of developing a basic solution)

Example (cont.) Objective function in standard Form is Maximize -w + A 1 + A 2 =0 (0) x 1 - 2x 2 + x 3 + S 1 = 11 (1) -4x 1 + x 2 + 2x 3 - S 2 +A 1 = 3 (2) A 1 = 3+4x 1 - x 2 - 2x 3 + S 2 -2x 1 + x 3 + A 2 = 1 (3) A 2 = 1+2x 1 - x 3 x 1, x 2, x 3, S 1, S 2, A 1, A 2  0 Substituting A 1, A 2 into (0) we get: -w + (3+4x 1 - x 2 - 2x 3 ) + (S x 1 - x 3 ) =0 - w + 6 x 1 - x 2 -3x 3 + S 2 = -4(0) x 1 - 2x 2 +x 3 + S 1 = 11(1) -4x 1 + x 2 + 2x 3 - S 2 +A 1 = 3(2) -2x 1 + x 3 + A 2 = 1(3) x 1, x 2, x 3, S 1, S 2, A 1, A 2  0

First Phase Solution At this point, we have found a feasible solution (w = 0): X 2 =1, X 3 =1. Now we need to solve the original problem (Second Phase)

Second Phase Solution  Now we need to solve the original (real) problem; so the Phase I w row is discarded and the actual objective is restored. Max -z -3x 1 + x 2 + x 3 = 0  Note that x 2, x 3 are basic variables (their coefficient in the objective function must be zero), so they must be removed (“priced out”) using the other equations (solving or using row operations).  First, we illustrate with equations (from the last tableau of the first phase) 3x S 1 - 2S 2 = 12(1) x 2 - S 2 = 1(2) x 2 = 1 + S 2 -2x 1 + x 3 = 1(3) x 3 = 1 + 2x 1 Thus the objective function becomes: -z -3x 1 + (1 + S 2 ) + (1 + 2x 1 ) = 0 -z - x 1 + S 2 = -2 (0)  If we use row operations, we can accomplish the same result.

Second Phase Solution This is the solution to the original problem