Linear Programming Example 5 Unboundedness Infeasibility.

Slides:



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

Linear Programming We are to learn two topics today: LP formulation
SIMPLEX METHOD FOR LP LP Model.
Introduction to Algorithms
Operations Management Linear Programming Module B - Part 2
Goal Programming How do you find optimal solutions to the following?
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India LINEAR PROGRAMMING GRAPHIC METHOD 2 CHAPTER.
Linear Programming Unit 2, Lesson 4 10/13.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.
Linear Programming Building Good Linear Models And Example 1 Sensitivity Analyses, Unit Conversion, Summation Variables.
Linear Programming (6S) and Transportation Problem (8S)
Linear Programming Integer Linear Models. When Variables Have To Be Integers Example – one time production decisions –Fractional values make no sense.
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming Applications
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
Linear Programming Example 2 Alternate Optimal Solutions.
Chapter 3 An Introduction to Linear Programming
Readings Readings Chapter 2 An Introduction to Linear Programming.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
A-REI Represent and solve equations and inequalities graphically
Managerial Decision Making and Problem Solving
L4 Graphical Solution Homework See new Revised Schedule Review Graphical Solution Process Special conditions Summary 1 Read for W for.
A vector space containing infinitely many vectors can be efficiently described by listing a set of vectors that SPAN the space. eg: describe the solutions.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Introduction to Linear Programming BSAD 141 Dave Novak.
Business Mathematics Rétallér Orsi.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
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
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
1 Chapter 4 The Simplex Algorithm PART 2 Prof. Dr. M. Arslan ÖRNEK.
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.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
LINEAR PROGRAMMING MEANING:
3.4: Linear Programming  Intro: Oftentimes we want to optimize a situation - this means to:  find a maximum value (such as maximizing profits)  find.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
1 Geometrical solution of Linear Programming Model.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
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
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Linear Programming – Introduction
6.5 Stochastic Prog. and Benders’ decomposition
Graphical Analysis – the Feasible Region
O.R. IN THE CLASSROOM SwedeBuild.
Chapter 4 Linear Programming: The Simplex Method
The application of mathematics and the scientific
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Goal Programming How do you find optimal solutions to the following?
Linear Programming Building Good Linear Models And Example 1
MGTSC 352 Lecture 9: Aggregate Planning
Linear Programming Problem
Linear Programming Integer Linear Models.
Linear Programming Integer Linear Models.
6.5 Stochastic Prog. and Benders’ decomposition
Practical Issues Finding an initial feasible solution Cycling
Presentation transcript:

Linear Programming Example 5 Unboundedness Infeasibility

The Problem TwinCon Liquors purchases and distributes wines to retailers. Four wines of particular interest their cost and selling price are given in the table below. During the next purchase cycle TwinCon wants: –To order at least 1000 bottles of each wine –To order at least twice as many bottles of imported wine as domestic wines. WineCountry Cost Selling Price Napa Grove US$ 5.00$ 8.50 Green Valley US$ 6.00$ 9.00 Riviera France$10.00$16.00 Cesarini Italy$ 8.00$12.00

The Model Let the X’s = # bottles of each wine ordered during the next purchase cycle Profit per bottle = (Selling Price) – (Cost) The constraint that # of bottles of imported wine (X 3 + X 4 ) should be ≥ twice the number of bottles of imported wine (X 1 + X 2 ) can be written as: -2X 1 -2X 2 + X 3 + X 4 ≥ 0 The model is: Max 3.50X 1 + 3X 2 + 6X 3 + 4X 4 s.t. X 1 ≥ 1000 X 2 ≥ 1000 X 3 ≥ 1000 X 4 ≥ X 1 - 2X 2 + X 3 + X 4 ≥ 0 Note: Since each variable is already restricted to be ≥ 1000, there is no need to add that the variables must also be ≥ 0.

=SUMPRODUCT($C$3:$F$3,C5:F5) Drag down

This means the problem is unbounded!

Analysis This indicates the problem is unbounded meaning TwinCon will make an infinite profit! –Impossible –Problem formulated correctly to this point –Constraints left out: Budget to purchase wine during next purchase cycle is $40000: 5X 1 + 6X X 3 + 8X 4 ≤ Max # bottles that can be ordered (warehouse space) is X 1 + X 2 + X 3 + X 4 ≤ 8000

=SUMPRODUCT($C$3:$F$3,C5:F5) Drag down

Analysis This time there is no feasible solution. –All constraints were input correctly. –They were just inconsistent. Note that if domestic bottles were at their minimum purchase level– this would amount to 2000 bottles. This would mean that at least 4000 bottles of imported wine must be purchased. If only 1000 on the more expensive (Riviera) were purchased this would mean that 3000 of the less expensive (Cesarini) would need to be purchased. –This solution would cost: 1000(5) (6) (10) (8) = $45,000 This exceeds the budget of $40,000. –Something must be modified. For example, suppose the purchase budget is increased to $50,000.

Change budget from $40,000 to $50,000

Optimal Solution 1040 bottles of Napa Grove 1000 bottles of Green Valley 3080 bottles of Riviera 1000 bottles of Cesarini Profit $29,120

Review Recognizing models that are unbounded Analyzing and modifying unbounded models Recognizing models that are infeasible Analyzing and modifying infeasible models.