Parametric Linear Programming-1 Parametric Linear Programming.

Slides:



Advertisements
Similar presentations
February 14, 2002 Putting Linear Programs into standard form
Advertisements

IEOR 4004 Midterm review (Part II) March 12, 2014.
Linear Programming Sensitivity Analysis How will a change in a coefficient of the objective function affect the optimal solution? How will a change in.
Standard Minimization Problems with the Dual
Solving Linear Programming Problems: The Simplex Method
Dr. Sana’a Wafa Al-Sayegh
What is sensitivity analysis? Why do we perform sensitivity analysis? How far do we like to perform sensitivity analysis? In an LP sensitivity analysis,
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
5.4 Simplex method: maximization with problem constraints of the form
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Operation Research Chapter 3 Simplex Method.
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
Solving Linear Programs: The Simplex Method
Optimization Mechanics of the Simplex Method
Linear Programming (LP)
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
The Simplex Procedure Daniel B. Taylor AAEC 5024 Department of Agricultural and Applied Economics Virginia Tech.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
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)
Chapter 6 Linear Programming: The Simplex Method
1 Linear programming Linear program: optimization problem, continuous variables, single, linear objective function, all constraints linear equalities or.
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
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.
Public Policy Modeling Simplex Method Tuesday, October 13, 2015 Hun Myoung Park, Ph.D. Public Management & Policy Analysis Program Graduate School of International.
Introduction to Operations Research
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
Simplex Method Adapting to Other Forms.  Until now, we have dealt with the standard form of the Simplex method  What if the model has a non-standard.
Solving Linear Programming Problems: The Simplex Method
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 4, 2011.
1. 2 Computing the Adjoint matrix: 3 Assignment #3 is available. Due: Monday Nov. 5, beginning of class.
Duality Theory.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to three  constraints.
1 Simplex Method for Bounded Variables Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference:
Part 4 Nonlinear Programming 4.5 Quadratic Programming (QP)
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
Gomory Cuts Updated 25 March Example ILP Example taken from “Operations Research: An Introduction” by Hamdy A. Taha (8 th Edition)“Operations Research:
1 THE REVISED SIMPLEX METHOD CONTENTS Linear Program in the Matrix Notation Basic Feasible Solution in Matrix Notation Revised Simplex Method in Matrix.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
Introduction to Operations Research
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
Business Mathematics MTH-367 Lecture 16. Chapter 11 The Simplex and Computer Solutions Methods continued.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Simplex Method Review. Canonical Form A is m x n Theorem 7.5: If an LP has an optimal solution, then at least one such solution exists at a basic feasible.
MTH374: Optimization For Master of Mathematics By Dr. M. Fazeel Anwar Assistant Professor Department of Mathematics, CIIT Islamabad 1.
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
Stat 261 Two phase method.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 7, 2011.
Sindhuja K, Annapoorani G, Pramela Devi S Department: CSE
Solving Linear Systems Algebraically
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Well, just how many basic
Algebra EquationsJeopardy
Presentation transcript:

Parametric Linear Programming-1 Parametric Linear Programming

Parametric Linear Programming-2 Systematic Changes in c j Objective function is replaced by Find the optimal solution as a function of θ Z*(θ) 0 θ1θ1 θ2θ2 θ

Parametric Linear Programming-3 Example: Wyndor Glass Problem Z(θ) = (3 + 2θ) x 1 +(5 - θ) x 2

Parametric Linear Programming-4 Example: Wyndor Glass Problem 0 ≤ θ ≤ 9/7 Range of θ Basic Var. Zx1x1 x2x2 x3x3 x4x4 x5x5 RHS Z(θ)1000(9-7θ)/6(3+2θ)/336-2θ x3x /3-1/32 x2x /206 x1x /31/32

Parametric Linear Programming-5 Example: Wyndor Glass Problem Range of θ Basic Var. Zx1x1 x2x2 x3x3 x4x4 x5x5 RHS Z(θ)100(-9+7θ)/20(5-θ)/227+5θ x4x x2x /201/23 x1x /7 ≤ θ ≤ 5

Parametric Linear Programming-6 Example: Wyndor Glass Problem Range of θ Basic Var. Zx1x1 x2x2 x3x3 x4x4 x5x5 RHS Z(θ)10-5+θ3+2θ0012+8θ x4x x5x x1x θ ≥ 5

Parametric Linear Programming-7 Procedure Summary for Systematic Changes in c j 1.Solve the problem with θ = 0 by the simplex method. 2.Use the sensitivity analysis procedure to introduce the Δc j = α j θ changes into Eq.(0). 3.Increase θ until one of the nonbasic variables has its coefficient in Eq.(0) go negative (or until θ has been increased as far as desired). 4.Use this variable as the entering basic variable for an iteration of the simplex method to find the new optimal solution. Return to Step 3.

Parametric Linear Programming-8 Systematic Changes in b i Constraints are replaced by Find the optimal solution as a function of θ Z*(θ) 0 θ1θ1 θ2θ2 θ

Parametric Linear Programming-9 Example: Wyndor Glass Problem y 1 + 3y 3 ≥ 3 + 2θ 2y 2 + 2y 3 ≥ 5 - θ

Parametric Linear Programming-10 Example: Wyndor Glass Problem 0 ≤ θ ≤ 9/7 Range of θ Basic Var. Zy1y1 y2y2 y3y3 y4y4 y5y5 RHS Z(θ) θ y3y3 01/301-1/30(3+2θ)/3 y2y2 0-1/3101/3-1/2(9-7θ)/6

Parametric Linear Programming-11 Example: Wyndor Glass Problem 9/7 ≤ θ ≤ 5 Range of θ Basic Var. Zy1y1 y2y2 y3y3 y4y4 y5y5 RHS Z(θ) θ y3y /2(5-θ)/2 y1y /2(-9+7θ)/2

Parametric Linear Programming-12 Range of θ Basic Var. Zy1y1 y2y2 y3y3 y4y4 y5y5 RHS Z(θ) θ y5y θ y1y θ Example: Wyndor Glass Problem θ ≥ 5

Parametric Linear Programming-13 Procedure Summary for Systematic Changes in b i 1.Solve the problem with θ = 0 by the simplex method. 2.Use the sensitivity analysis procedure to introduce the Δb i = α i θ changes to the right side column. 3.Increase θ until one of the basic variables has its value in the right side column go negative (or until θ has been increased as far as desired). 4.Use this variable as the leaving basic variable for an iteration of the dual simplex method to find the new optimal solution. Return to Step 3.