16.410: Eric Feron / MIT, Spring 2001 Introduction to the Simplex Method to solve Linear Programs Eric Feron Spring 2001.

Slides:



Advertisements
Similar presentations
February 21, 2002 Simplex Method Continued
Advertisements

February 14, 2002 Putting Linear Programs into standard form
Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.
IEOR 4004 Midterm Review (part I)
Linear Programming Vocabulary Linear Programming Objective Function Constraints.
EMIS 8374 LP Review: The Ratio Test. 1 Main Steps of the Simplex Method 1.Put the problem in row-0 form. 2.Construct the simplex tableau. 3.Obtain an.
Linear Programming – Simplex Method: Computational Problems Breaking Ties in Selection of Non-Basic Variable – if tie for non-basic variable with largest.
Hillier and Lieberman Chapter 4.
Computational Facility Layout
LINEAR PROGRAMMING Modeling a problem is boring --- and a distraction from studying the abstract form! However, modeling is very important: --- for your.
Simplex (quick recap). Replace all the inequality constraints by equalities, using slack variables.
Solving LP Models Improving Search Special Form of Improving Search
Lecture 3 Linear Programming: Tutorial Simplex Method
Linear Programming (LP) (Chap.29)
Operation Research Chapter 3 Simplex Method.
Linear Programming – Simplex Method
Chapter 6 Linear Programming: The Simplex Method
Solving Linear Programming Problems: The Simplex Method
Chapter 5 The Simplex Method The most popular method for solving Linear Programming Problems We shall present it as an Algorithm.
Dr. Sana’a Wafa Al-Sayegh
Chapter 6 Linear Programming: The Simplex Method
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Chapter 6 Linear Programming: The Simplex Method
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
Linear Programming Fundamentals Convexity Definition: Line segment joining any 2 pts lies inside shape convex NOT convex.
Linear Inequalities and Linear Programming Chapter 5
The Simplex Method: Standard Maximization Problems
Operation Research Chapter 3 Simplex Method.
Design and Analysis of Algorithms
Solving Linear Programs: The Simplex Method
Linear Programming (LP)
The Simplex Method.
5.6 Maximization and Minimization with Mixed Problem Constraints
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
Easy Optimization Problems, Relaxation, Local Processing for a small subset of variables.
ISM 206 Lecture 3 The Simplex Method. Announcements.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Linear Programming - Standard Form
Learning Objectives for Section 6.2
Chapter 6 Linear Programming: The Simplex Method
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
Some Key Facts About Optimal Solutions (Section 14.1) 14.2–14.16
Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤
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.
EML Spring’08 EML Engineering Design Systems II (Senior Design Project) Optimization Theory and Optimum Design Linear Programming Hyman: Chapter.
Linear Programming – Simplex Method
Algebraic Simplex Active Learning – Module 4 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology.
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents CD Chapter 14 (Solution Concepts for Linear Programming) Some Key Facts.
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.
Introduction to Operations Research
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
Foundation of the Simplex Method.  Constraints Boundary Equations  Graphical approach is very limited based on number of variables. The simplex method.
Part 3. Linear Programming 3.2 Algorithm. General Formulation Convex function Convex region.
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
The Simplex Method. and Maximize Subject to From a geometric viewpoint : CPF solutions (Corner-Point Feasible) : Corner-point infeasible solutions 0.
Solving Linear Program by Simplex Method The Concept
Chapter 5 The Simplex Method
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Well, just how many basic
Presentation transcript:

16.410: Eric Feron / MIT, Spring 2001 Introduction to the Simplex Method to solve Linear Programs Eric Feron Spring 2001

16.410: Eric Feron / MIT, Spring 2001 Algorithms The simplex algorithm: before all, an algorithm The way an algorithm works: –Initialization step –Iteration step –Optimality test (stopping rule) –Exit No? Yes?

16.410: Eric Feron / MIT, Spring 2001 Assumption, basic results for simplex If there is exactly one optimal solution, it is corner point feasible If there are multiple optimal solutions, then at least two must be adjacent; That is, connected by an edge of the constraint polytope There are only a finite number of feasible corner-point solutions If a corner-point solution has no adjacent corner-point solution that is better, then it is optimal

16.410: Eric Feron / MIT, Spring 2001 Essence of the simplex method Step 1: Start at a corner-point feasible solution (Initialization) Step 2: Move to a better adjacent feasible solution Step 3: Optimality test. The corner-point solution is optimal when no better adjacent corner-point solution can be found. A really simple algorithm, if we have good book keeping procedures.

16.410: Eric Feron / MIT, Spring 2001 Setting up the simplex method (2,6) x2x2 x1x1 Maximize Z=3x1 + 5x2 Subject to: x1 <= 4 x2 <= 6 3x1 + 2x2 <= 18 x1 >= 0 x2 >= 0 First step: Add SLACK variables Slack variables are a way to locate the current point with respect to all the constraints Let x=(x1, x2) Distance from x to x2=0 is x1 Distance from x to x1=0 is x2 Distance from x to x1=4 is 4-x1=x3 Distance from x to x2=6 is 6-x2=x4 x3x3 x4x4 x5x5 Distance from x to 3x1+2x2=18 is proportional to 18-3x1-2x2=x5

16.410: Eric Feron / MIT, Spring 2001 Salck variables (ct'd) So we can characterize the position of any point x in the decision space by its distance to all the constraints x1, x2, x3, x4, and x5 That's a new, generalized coordinate system (obviously highly redundant) Any corner point is the intersection of two constraints: For example the origin 1 is the intersection of x1>= 0 and x2>=0 In general, corner points are defined by two of the generalized coordinates vanishing to zero

16.410: Eric Feron / MIT, Spring 2001 Slack variables (ct'd) (2,6) x2x2 x1x1 x3x3 x4x4 x5x5

16.410: Eric Feron / MIT, Spring 2001 Basic, nonbasic variables At the origin zero, these distances are zero: x1=0 x2=0 And the other distances are nonzero: x3 = 4 x4 = 6 x5=18 Consider now the point (2,6) (numbered 3). At that point: x4=0 x5=0 x1=2 x2=6 x3=2 These are called nonbasic variables These are called basic variables These are the active constraints, nonbasic variables These are the nonactive constraints, basic variables

16.410: Eric Feron / MIT, Spring (2,6) Simplex method, illustrated Rewriting the original optimization problem with x1,x2,x3,x4,x5 Maximize: Z=3x1+5x2 Subject to: x1+x3=4 x2+x4=6 3x1+2x2+x5=18 (2,6)-centric coordinates: Express x1, x2, x3, Z as functions of (x4, x5) From (0, 6)-centric coordinates, we get x1=6/3+2/3x4-x5/3 x2=6-x4 x3=4-x1=4-6-2/3x4+x5/3 and Z=30+3x1-5x4 =30+6+2x4-x5-5x4 =36-3x4-x5 Cost at (2,6) is 36 There is no way to improve => So we're done. x5 x4 (0,6)-centric coordinates Z=30+3x1-5x4 (Z at (0,6) is 30) (a) x1+x3=4 (b) x4+x2=6 (c) 3x1-2x4+x5=6 We can obtain an improvement of Z by moving x1 up. How far up? (a) says 4, (b) says nothing, (c) says 2=>so x1 moves to 2 => so x4 becomes the new nonbasic variable. (2,6) is the new corner-point feasible solution. x1 x4 Look at the cost function. Which decision variable has best marginal gain. x2, of course. (However that's only a heuristic. Picking x1 would work too.) Choice of x1 or x2 (ct'd) How far can we move x2? That depends on the constraints! In our case the constraint x2=6 is hit first (that's easy to see). Thus the new corner point is x1=0 x4=0 x1 x2 x2x2 x1x1 A problem formulation that's well adapted to start from (0,0): Can find out cost & x3, x4, x5 as a function of x1, x2 easily: "(0,0)- centric coordinates" x1=0 and x2=0 are the current active constraints. Let's try to move away from one of these constraints: –Either make x1>0 –Or make x2>0 –Which one do we pick? Same problem Z=3x1+5(6-x4) x1+x3=4 x4+x2=6 3x1+2(6-x4)+x5=18 Same problem Z=30+3x1-5x4 x1+x3=4 x4+x2=6 3x1-2x4+x5=6 x2,x3,x5 found easily as functions of x1, x4 New, (0,6)-centric coordinates (x1,x4) make new "natural coordinate axes" x4 x1

16.410: Eric Feron / MIT, Spring 2001 Your example Maximize Z=4x1+3x2+6x3 Subject to 3x1+x2+3x3<=30 2x1+2x2+3x3<=40 x1>=0, x2>=0, x3>=0