Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Linear Programming Problem
Linear Programming Graphical Solution Procedure. Two Variable Linear Programs When a linear programming model consists of only two variables, a graphical.
and Models Without Unique Optimal Solutions
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Linear and Integer Programming Models
Operations Management Linear Programming Module B - Part 2
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.
Chapter 2: Introduction to Linear Programming
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Chapter 3 An Introduction to Linear Programming
3 Components for a Spreadsheet Linear Programming Problem There is one cell which can be identified as the Target or Set Cell, the single objective of.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Readings Readings Chapter 2 An Introduction to Linear Programming.
FORMULATION AND GRAPHIC METHOD
Linear Programming.
Graphical Solutions Plot all constraints including nonnegativity ones
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Special Conditions in LP Models (sambungan BAB 1)
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Linear and Integer Programming Models 1 Chapter 2.
Managerial Decision Making and Problem Solving
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
L4 Graphical Solution Homework See new Revised Schedule Review Graphical Solution Process Special conditions Summary 1 Read for W for.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Chapter 7 Introduction to Linear Programming
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to Linear Programming BSAD 141 Dave Novak.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
1 Introduction to Linear Programming Linear Programming Problem Linear Programming Problem Problem Formulation Problem Formulation A Simple Maximization.
1 1 Slide Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
An Introduction to Linear Programming
Decision Support Systems
An Introduction to Linear Programming Pertemuan 4
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Chapter 2 An Introduction to Linear Programming
Graphical Analysis – the Feasible Region
Introduction to linear programming (LP): Minimization
Graphical Solution Procedure
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Linear Programming Problem
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
1.6 Linear Programming Pg. 30.
Practical Issues Finding an initial feasible solution Cycling
Presentation transcript:

Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions

Finding the Optimal Point - Review X X1 OPTIMAL POINT Move the objective function line parallel to itself until it touches the last point of the feasible region.

Minimization Objective Function X X1 OPTIMAL POINT

Different Objective Function X X1 OPTIMAL POINT

Another Objective Function X X1 OPTIMAL POINT

Still Another Objective Function X X1 OPTIMAL POINT

Extreme Points and Optimal Solutions Fundamental Linear Programming Theorem: Why not simply list all extreme points? –More cumbersome than solving the model in most cases. –Model may not have an optimal solution. If a linear programming model has an optimal solution, then extreme point an extreme point will be optimal.

Models With No Solutions Infeasibility X X1. Max 8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ X 1 + 4X 2 ≤ 2400 X 1 - X 2 ≤ 350 X 1, X 2 ≥ 0 X 1 ≥ 800 No points in common. No points satisfy all constraints simultaneously. No Solutions! Problem isINFEASIBLE.

Infeasibility infeasibleA problem is infeasible when there are no solutions that satisfy all the constraints. Infeasibility can occur from –Input Error –Misformulation –Simply an inconsistent set of contraints SolveExcel – When Solve is clicked:

Unbounded Feasible Region Models With An “Unbounded” Solution X X1 Max 8X 1 + 5X 2 s.t. X 1 - X 2 ≤ 350 X 1 ≥ 200 X 2 ≥ 200 Can increase indefinitely Unbounded Solution

Unbounded Feasible Region Models With An Unbounded Feasible Region – Optimal Solution X X1 Min 8X 1 + 5X 2 s.t. X 1 - X 2 ≤ 350 X 1 ≥ 200 X 2 ≥ 200 OPTIMAL POINT

Unboundedness An unbounded feasible region extends to infinity in some direction. If the solution is unbounded, the feasible region must be unbounded. If the feasible region is unbounded, the solution may or may not be unbounded. An unbounded solution means you left out some constraints – you cannot make an “infinite” profit. SolveExcel – When Solve is clicked Means the problem isunbounded

Multiple Optimal Solutions s.t.2X 1 + 1X 2 ≤ X 1 + 4X 2 ≤ X 1 - 1X 2 ≤ 350 X 1, X 2 ≥ 0 2X 1 + 1X 2 ≤ X1 + 4X2 ≤ X1 - 1X2 ≤ 350 X X1 MAX 8X1 + 4X2 Optimal Extreme Point All points on the boundary between optimal extreme points are also optimal

Multiple Optimal Solutions canWhen an objective function line is parallel to a constraint the problem can have multiple optimal solutions. –The constraint must not be a redundant constraint but must be a boundary constraint. –The objective function must move in the direction of the constraint— MINIn the previous example if the objective function had been MIN 8X 1 + 4X 2, then it is moved in the opposite direction of the constraint and (0,0) would be the optimal solution. Multiple optimal solutions allow the decision maker to use secondary criteria to select one of the optimal solutions that has another desirable characteristic (e.g. Max X 1 or X 1 = 3X 2, etc.)

Alternate Optimal Solution To find the second optimal solution: 1.Observe that an Allowable Increase or Allowable Decrease for the objective function coefficient of some variable X j is 0 2.Add a constraint that sets the value function cell to the optimal value from the first optimal solution. 3.Change objective function to If the Allowable Increase = 0, change objective to maximize X j If the Allowable Decrease = 0, change objective to minimize X j

Multiple Optimal Solutions in Excel Excel – Identification of multiple solutions Sensitivity Report If an Allowable Decrease or an Allowable Increase of an Objective Function Coefficient is 0.

Alternate Optimal Solution in Excel

Generating the Multiple Optimal Solutions Any weighted average of optimal solutions is also optimal. –In the previous example it can be shown that the two optimal extreme points are (320,360) and (450, 100). Thus.5(320,360) +.5(450,100) = (385,230) is also an optimal point that is half-way between these two points..8(320,360) +.2(450,100) = (346,308) is also an optimal point that is 8/10 of the way up the line toward (320,360).

Review When a linear programming model is solved it: –Has a unique optimal solution –Has multiple optimal solutions –Is Infeasible –Is unbounded Identification of each –By graph –By Excel If a linear program has an optimal solution, then an extreme point is optimal.