Question 2: How will changes in the objective function s coefficients change the optimal solution?



Similar documents
Question 2: How do you solve a linear programming problem with a graph?

Sensitivity Report in Excel

3.1 Solving Systems Using Tables and Graphs

The Graphical Method: An Example

Chapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach

5 Systems of Equations

Linear Programming. Solving LP Models Using MS Excel, 18

Chapter 9. Systems of Linear Equations

Session 7 Bivariate Data and Analysis

EQUATIONS and INEQUALITIES

PLOTTING DATA AND INTERPRETING GRAPHS

Section 1.1 Linear Equations: Slope and Equations of Lines

POTENTIAL OUTPUT and LONG RUN AGGREGATE SUPPLY

Linear Programming Supplement E

Module1. x y 800.

OPRE 6201 : 2. Simplex Method

EdExcel Decision Mathematics 1

Section 7.2 Linear Programming: The Graphical Method

SEQUENCES ARITHMETIC SEQUENCES. Examples

1. Graphing Linear Inequalities

The Point-Slope Form

1. Briefly explain what an indifference curve is and how it can be graphically derived.

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Lecture 1: Systems of Linear Equations

Elements of a graph. Click on the links below to jump directly to the relevant section

Special Situations in the Simplex Algorithm

CORRELATION ANALYSIS

Slope-Intercept Equation. Example

10.1 Systems of Linear Equations: Substitution and Elimination

What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of y = mx + b.

SYSTEMS OF LINEAR EQUATIONS

Algebraic expressions are a combination of numbers and variables. Here are examples of some basic algebraic expressions.

Using Mathematics to Solve Real World Problems

x x y y Then, my slope is =. Notice, if we use the slope formula, we ll get the same thing: m =

Sensitivity Analysis with Excel

High School Algebra Reasoning with Equations and Inequalities Solve systems of equations.

2.2 Derivative as a Function

Chapter 4 Online Appendix: The Mathematics of Utility Functions

Review of Fundamental Mathematics

Systems of Equations Involving Circles and Lines

5.1 Bipartite Matching

1 Solving LPs: The Simplex Algorithm of George Dantzig

Practical Guide to the Simplex Method of Linear Programming

Profit and Revenue Maximization

Elasticity. I. What is Elasticity?

Linear Programming. March 14, 2014

Keynesian Macroeconomic Theory

Section 10.4 Vectors

Systems of Linear Equations in Three Variables

Example: Boats and Manatees

Linear and quadratic Taylor polynomials for functions of several variables.

Bungee Constant per Unit Length & Bungees in Parallel. Skipping school to bungee jump will get you suspended.

Insurance. Michael Peters. December 27, 2013

Determine If An Equation Represents a Function

3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Effects of changing slope or y-intercept

GRAPHING IN POLAR COORDINATES SYMMETRY

3. Solve the equation containing only one variable for that variable.

Airport Planning and Design. Excel Solver

Duality in Linear Programming

Simple Linear Programming Model

POLYNOMIAL FUNCTIONS

No Solution Equations Let s look at the following equation: 2 +3=2 +7

Predicting Flight Delays

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

The Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy

Quantitative Analysis BA 452

Solving Quadratic Equations

Solving Systems of Linear Equations

Linear Equations ! $ & " % & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development

IV. ALGEBRAIC CONCEPTS

Problem Set #3 Answer Key

Relationships Between Two Variables: Scatterplots and Correlation

Chapter 3: Section 3-3 Solutions of Linear Programming Problems

CHAPTER 3 CONSUMER BEHAVIOR

Systems of Linear Equations: Two Variables

International Doctoral School Algorithmic Decision Theory: MCDA and MOO

Chapter 27: Taxation. 27.1: Introduction. 27.2: The Two Prices with a Tax. 27.2: The Pre-Tax Position

Linear Equations. Find the domain and the range of the following set. {(4,5), (7,8), (-1,3), (3,3), (2,-3)}

Nash Equilibrium and Duopoly Theory

Describing Relationships between Two Variables

EXPERIMENT 3 Analysis of a freely falling body Dependence of speed and position on time Objectives

1.3 LINEAR EQUATIONS IN TWO VARIABLES. Copyright Cengage Learning. All rights reserved.

MICROECONOMICS II PROBLEM SET III: MONOPOLY

9.1 Cournot and Bertrand Models with Homogeneous Products

LINEAR PROGRAMMING WITH THE EXCEL SOLVER

Numerical integration of a function known only through data points

Piecewise Cubic Splines

Graphing Linear Equations

Linear Programming Notes VII Sensitivity Analysis

EL-9650/9600c/9450/9400 Handbook Vol. 1

Linear Programming. April 12, 2005

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

Absorbance Spectrophotometry: Analysis of FD&C Red Food Dye #40 Calibration Curve Procedure

Writing the Equation of a Line in Slope-Intercept Form

Solving Systems of Linear Equations

Core Maths C1. Revision Notes

We are often interested in the relationship between two variables. Do people with more years of full-time education earn higher salaries?

Standard Form of a Linear Programming Problem

Answer Key Building Polynomial Functions

Transcription:

Question 2: How will changes in the objective function s coefficients change the optimal solution? In the previous question, we examined how changing the constants in the constraints changed the optimal solution to a standard maximization problem. Such modification led to a different feasible region and changes to the optimal solution. In this question, we examine how changes in the coefficients of the objective function change the optimal solution. If one of the coefficients of the objective function increases or decreases, the feasible region remains the same. Since the feasible region is defined by the constraints and not the objective function, there are no changes to the corner points. A change in one of the coefficients changes the slope of the isoline, the line that corresponds to setting the objective function equal to a constant. Let s recall the problem we have been analyzing: Maximize P 70x 120y subject to x y 35 x 3y 75 2x y 60 x 0, y 0 Figure 10 - The feasible region for the standard maximization problem on the left. The objective function takes on the optimal value P 3450 at the corner point (15, 20). The isoprofit line 70x 120y 3450 just touches the feasible region at that point verifying this assertion.

Now let s try increasing and decreasing the coefficient on x in the objective function. Figure 11 This graph shows the feasible region with the isoprofit line at the optimal solution (gray dashed line) and the isoprofit line for the optimal solution in the modified problem (purple dashed line). The coefficient on x has decreased from 70 to 40. As the coefficient on x is decreased, the isoprofit line for the optimal solution gets less steep. At a value of 40, the isoprofit line passes through (0, 25) and (15, 20). At this point, the isoprofit line forms the border of the feasible region there so all points on the line between (0, 25) and (15, 20) yield the same maximum profit. If the coefficient is decreased to a value less than 40, (15, 20) is no longer part of the optimal solution.

Figure 12 -This graph shows the feasible region with the isoprofit line at the optimal solution (gray dashed line) and the isoprofit line for the optimal solution in the modified problem (purple dashed line). The coefficient on x has increased from 70 to 120. As the coefficient on x is increased, the isoprofit line for the optimal solution gets steeper. At a value of 120, the isoprofit line passes through (0, 25) and (25, 10). The isoprofit line forms the border of the feasible region there, so all points on the line between (0, 25) and (25, 10) yield the same maximum profit. If the coefficient is increased to a value greater than 120, (15, 20) is no longer part of the optimal solution. As long as the coefficient on x in the objective function falls between 40 to 120, the optimal solution includes xy, 15,20. If the coefficient is equal to 40 or 120, any ordered pair on a line connecting 15, 20 to one of the adjacent corner points is optimal. However, if the coefficient on x falls outside of 40 to 120 the optimal solution moves to a new corner point. Recall that the coefficient on x in the objective function is the profit for each frame bag. If the profit per frame bag were to increase by up to $50 (to $120) or decrease by up to $30 (to $40), the optimal solution would not change. This solution, 15 frame bags and 20 panniers, is fairly insensitive to changes in the coefficient on x. Even though the location

of the optimal solution does not change over this range, the profit does not change. Notice that we are only varying one coefficient at a time. Varying both coefficients simultaneously is beyond the scope of this presentation. Example 3 Find the Range of Values For Which a Corner Point Remains Optimal The coefficient on y in the objective function for the linear programming problem Maximize P 70x 120y subject to x y 35 x 3y 75 2x y 60 x 0, y 0 can be varied to find a range of values over which 15, 20 is the optimal solution. Over what range of coefficient values will 15, 20 remain optimal? Solution Let s examine the graphical solution for this linear programming problem.

From the earlier discussion on varying the coefficient on x, we observed that changing the coefficient causes the slope of the isoprofit to change. If the slope of the isoprofit line increases so that it coincides with the constraint x y 35, the optimal solution is all points on the line connecting 15, 20 and 25,10. If the slope of the isoprofit line decreases so that it coincides with the constraint x 3y 75, the optimal solution is all point on the line connecting 15, 20 and 0, 25. Figure 13 In a, the coefficient on y in the objective function has been increased from 120 to 210. In b, the coefficient on y has been decreased from 120 to 70.

As long as the coefficient on y falls in the range 70 to 210, the solution 15, 20 is optimal. Outside of this range, 15, 20 is no longer optimal. If we can determine the coefficient values that cause the isoprofit line to fall on the binding constraint borders, we know the range of values over which the solution remains optimal. In Figure 13a, the constraint border x 3y 35 and isoprofit line 70x 210y 5250 coincide. Notice that on each line, the coefficient on y is three times as large as the coefficient on x. Because of this, both lines have the same slope. We can always use this information to find the values of any missing constraints. For instance, to find the coefficient on y in the objective function that makes its slope the same as the slope on x y 35, we can observe that the coefficients must be the same. Therefore, the coefficients in the objective function must be the same. Since we have fixed the coefficient on x and are only varying the coefficient on y, we conclude that isoprofit lines for P 70x 70y are parallel to the constraint border x y 35. In particular, the isoprofit line 70x 70y 2450 is exactly the same line. Putting this together, we observe that the coefficient on y can range from 70 to 210 and the corner point at 15, 20 is optimal.