Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.

Slides:



Advertisements
Similar presentations
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Advertisements

Linear Programming Problem
and Models Without Unique Optimal Solutions
Linear Programming.
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
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
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
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.
Chapter 2: Introduction to Linear Programming
Sensitivity of the Objective Function Coefficients
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
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.
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.
Linear Programming Sensitivity of the Objective Function Coefficients.
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
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 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.
1 Linear and Integer Programming Models Chapter 2.
1/24: Linear Programming & Sensitivity Analysis Review: –LP Requirements –Graphical solutions Using MS Excel for Linear Programming Sensitivity Analysis.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.
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.
Linear Programming Models: Graphical and Computer Methods
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
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.
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.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
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
An Introduction to Linear Programming Pertemuan 4
Graphical Analysis – the Feasible Region
Introduction to linear programming (LP): Minimization
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.
Presentation transcript:

Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions

Models With No Solutions - Infeasibility Max 8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ X 1 + 4X 2 ≤ 2400 X 1 - X 2 ≤ 350 X 1 ≥ 800 X 1, X 2 ≥ 0

Solver - Infeasible

Solver Results

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

Models With An “Unbounded” Solution Max 8X 1 + 5X 2 s.t. X 1 - X 2 ≤ 350 X 1 ≥ 200 X 2 ≥ 200

Solver - Unbounded

Solver Results - Unbounded

Unboundedness 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 Max 8X 1 + 4X 2 s.t.2X 1 + 1X 2 ≤ X 1 + 4X 2 ≤ 2400 X 1 - X 2 ≤ 350 X 1, X 2 ≥ 0

Multiple Optimal Solutions canWhen slope of objective function line equals slope of binding constraint the problem can have multiple optimal solutions. slopeThe slope of a line written as: aX 1 + bX 2 = d is: Object function: 8X 1 + 4X 2 Slope is -8/4 = -2 Plastic constraint: 2X 1 + 1X 2 ≤ 1000 Slope is -2/1 = -2 -a/b

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

Original Optimal Solution in Excel

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 Excel Find alternative solutions for multiple optimal solutions problem