Graphical Solutions Plot all constraints including nonnegativity ones

Slides:



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

© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
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
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.
Introduction to Management Science
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 2: Introduction to Linear Programming
An Introduction to Linear Programming : Graphical and Computer Methods
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.
LINEAR PROGRAMMING INTRODUCTION
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
Non-Linear Simultaneous Equations
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Linear Programming Models: Graphical and Computer Methods
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
Chapter 3 Introduction to Optimization Modeling
START EXCEL BUILD OR RETRIEVE YOUR OPTIMIZATION MODEL SAVE YOUR WORKBOOK!! CHOOSE “Solver…” IN THE “Tools” MENU SPECIFY IN SOLVER DIALOG BOX: 1.CELL TO.
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 19 Linear Programming McGraw-Hill/Irwin
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
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.
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
MATH 527 Deterministic OR Graphical Solution Method for Linear Programs.
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.
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.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
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.
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.
1. 2 We studying these special cases to: 1- Present a theoretical explanation of these situations. 2- Provide a practical interpretation of what these.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
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.
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.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
An Introduction to Linear Programming
Decision Support Systems
An Introduction to Linear Programming Pertemuan 4
Chapter 2 An Introduction to Linear Programming
Solver & Optimization Problems
prepared by Imran Ismail
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.
Presentation transcript:

Graphical Solutions Plot all constraints including nonnegativity ones Determine the feasible region. (The feasible region is the set of feasible solution points) Identify the optimal solution in the feasible region using either the level curve method the extreme point method

Feasible Regions The feasible region for a two-variable linear programming problem can be nonexistent, a single point, a line, a polygon, or an unbounded area. If a constraint can be removed without affecting the shape of the feasible region, the constraint is said to be redundant. An overconstrained LP that does not have one point satisfying all the constraints simultaneously is said to be infeasible and a feasible region does not exist. The feasible region for the KPiller problem is a polygon, illustrating that an infinite number of feasible solutions exist for this problem. (See class handout). Assuming that a feasible region exists, an optimal solution will always occur at one or more of the extreme points, where an extreme point is a corner point of the feasible region.

Level Curves Plot a level curve for a targeted objective function value Level curves are parallel lines that shift away from the origin as the targeted objective function value increases Slide the level curve in the direction of improvement (away from the origin if maximizing, toward the origin if minimizing) until it reaches the last point where it still touches at least one point in the feasible region Solve the two equations which specify the identified feasible point to determine the optimal solution

Extreme Point Method Extreme Point Z = 5000*E9 + 4000*F9 Determine all of the extreme points of the feasible region: Extreme Point (3.5, 3) (6.5, 3) (4.5, 7) (1.5, 9) Calculate the resulting objective function value for each point: Z = 5000*E9 + 4000*F9 $29,500 $44,500 $50,500 $43,500

Types of LP Solutions Any linear program falls in one of three categories: is infeasible has a unique optimal solution or alternate optimal solutions has an objective function that can be increased without bound In the graphical method, if the objective function line is parallel to a boundary constraint in the direction of optimization, there are alternate optimal solutions, with all points on this line segment being optimal.

Solver Result Messages Solver found a solution. All constraints and optimality conditions are satisfied: Solver has correctly identified an optimal solution for the problem you have formulated. Note that there may be alternative optimal solutions possible however. Solver has converged to the current solution. All constraints are satisfied: You have not selected the linear programming option in the Solver options. Thus nonlinear programming is being performed and this is the best solution Solver has found so far. It is not guaranteed to be the optimal one however.

Example: Infeasible Problem Solve graphically for the optimal solution: Max z = 2x1 + 6x2 s.t. 4x1 + 3x2 < 12 2x1 + x2 > 8 x1, x2 > 0

Example: Infeasible Problem There are no points that satisfy both constraints, hence this problem has no feasible region, and no optimal solution. x2 x1 4x1 + 3x2 < 12 2x1 + x2 > 8 3 4 8

Solver Result Message Solver could not find a feasible solution Possible problems if you know the solution should be feasible are: too many constraints in Solver one of the constraints may be entered wrong (e.g. the inequality sign might be going the wrong way) you may not have the correct changing cells (decision variables) specified in Solver one or more formulas in the spreadsheet may have been erased.

Example: Unbounded Problem Solve graphically for the optimal solution: Max z = 3x1 + 4x2 s.t. x1 + x2 > 5 3x1 + x2 > 8 x1, x2 > 0

Example: Unbounded Problem The feasible region is unbounded and the objective function line can be moved parallel to itself without bound so that z can be increased infinitely. x2 x1 3x1 + x2 > 8 x1 + x2 > 5 Max 3x1 + 4x2 5 8 2.67

Solver Result Messages Set Cell values do not converge: Your model as formulated is unbounded. One or more constraint is missing from the problem or entered wrong (e.g. an inequality sign is in the wrong direction). Often times the modeler has forgotten to check the Assume Nonnegativity option in Solver. Note: A feasible region may be unbounded and yet there may be optimal solutions. In the case where the objective does not move in the direction of the unboundedness, you will see the optimal Solver solution message instead of this message.

Solver Result Messages The linearity conditions required by this LP Solver are not satisfied: Solver’s preliminary tests indicate that your model is not linear. Check for use of functions such as IF, MAX, PV, VLOOKUP which create linearity problems. Write the algebraic logic programmed in the objective and constraint cells on paper to ensure linear relationships. Sometimes this message occurs due to poor scaling (see text section 3.11). If you think your model is linear, try resolving the model again. Often times Solver can find the solution the second time. If not, use the Use Automatic Scaling option in Solver. Solver will attempt to rescale your data. If that doesn’t work, rescale the data yourself.