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


 Arnold Chandler
 2 years ago
 Views:
Transcription
1 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.
2 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.
3 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
4 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.
5 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.
6 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.
Question 2: How do you solve a linear programming problem with a graph?
Question 2: How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.
More informationSensitivity Report in Excel
The Answer Report contains the original guess for the solution and the final value of the solution as well as the objective function values for the original guess and final value. The report also indicates
More informationSection 7.1 Solving Linear Systems by Graphing. System of Linear Equations: Two or more equations in the same variables, also called a.
Algebra 1 Chapter 7 Notes Name Section 7.1 Solving Linear Systems by Graphing System of Linear Equations: Two or more equations in the same variables, also called a. Solution of a System of Linear Equations:
More informationMATH 105: Finite Mathematics 32: Solving Linear Programming Problems
MATH 105: Finite Mathematics 32: Solving Linear Programming Problems Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2006 Outline 1 Solving Linear Programming Problems 2 Linear Programming Solution
More information3.1 Solving Systems Using Tables and Graphs
Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system
More informationChapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach
Chapter 5 Linear Programming in Two Dimensions: A Geometric Approach Linear Inequalities and Linear Programming Section 3 Linear Programming gin Two Dimensions: A Geometric Approach In this section, we
More informationChapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY
Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS Once the problem is formulated by setting appropriate objective function and constraints, the next step is to solve it. Solving LPP
More informationStudy Resources For Algebra I. Unit 1D Systems of Equations and Inequalities
Study Resources For Algebra I Unit 1D Systems of Equations and Inequalities This unit explores systems of linear functions and the various methods used to determine the solution for the system. Information
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,
More informationLinear Programming IS 601
Linear Programming IS 01 eoptimization.com A Resource Page on Optimization Distribution System at Proctor and Gamble Proctor and Gamble needed to consolidate and redesign their North American distribution
More information5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of EquationsGraphically and Algebraically Solving Systems  Substitution Method Solving Systems  Elimination Method Using Dimensional Graphs to Approximate
More informationFundamentals of Operations Research Prof.G. Srinivasan Department of Management Studies Lecture No. # 03 Indian Institute of Technology, Madras
Fundamentals of Operations Research Prof.G. Srinivasan Department of Management Studies Lecture No. # 03 Indian Institute of Technology, Madras Linear Programming solutions  Graphical and Algebraic Methods
More informationSUPPLEMENT TO CHAPTER
SUPPLEMENT TO CHAPTER 6 Linear Programming SUPPLEMENT OUTLINE Introduction and Linear Programming Model, 2 Graphical Solution Method, 5 Computer Solutions, 14 Sensitivity Analysis, 17 Key Terms, 22 Solved
More informationLINEAR PROGRAMMING PROBLEM: A GEOMETRIC APPROACH
59 LINEAR PRGRAMMING PRBLEM: A GEMETRIC APPRACH 59.1 INTRDUCTIN Let us consider a simple problem in two variables x and y. Find x and y which satisfy the following equations x + y = 4 3x + 4y = 14 Solving
More informationChapter 9. Systems of Linear Equations
Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More informationChapter 4  Systems of Equations and Inequalities
Math 233  Spring 2009 Chapter 4  Systems of Equations and Inequalities 4.1 Solving Systems of equations in Two Variables Definition 1. A system of linear equations is two or more linear equations to
More information2.1 Systems of Linear Equations
. Systems of Linear Equations Question : What is a system of linear equations? Question : Where do systems of equations come from? In Chapter, we looked at several applications of linear functions. One
More informationThe slope m of the line passes through the points (x 1,y 1 ) and (x 2,y 2 ) e) (1, 3) and (4, 6) = 1 2. f) (3, 6) and (1, 6) m= 6 6
Lines and Linear Equations Slopes Consider walking on a line from left to right. The slope of a line is a measure of its steepness. A positive slope rises and a negative slope falls. A slope of zero means
More informationLines and Linear Equations. Slopes
Lines and Linear Equations Slopes Consider walking on a line from left to right. The slope of a line is a measure of its steepness. A positive slope rises and a negative slope falls. A slope of zero means
More informationLinear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods Learning Objectives Students will be able to: 1. Understand the basic assumptions and properties of linear programming (LP). 2. Graphically solve
More information2. Efficiency and Perfect Competition
General Equilibrium Theory 1 Overview 1. General Equilibrium Analysis I Partial Equilibrium Bias 2. Efficiency and Perfect Competition 3. General Equilibrium Analysis II The Efficiency if Competition The
More information4.1 Solving a System of Linear Inequalities
4.1 Solving a System of Linear Inequalities Question 1: How do you graph a linear inequality? Question : How do you graph a system of linear inequalities? In Chapter, we were concerned with systems of
More information3.1 Graphing Systems of Linear Inequalities
3.1 Graphing Systems of Linear Inequalities An inequality is an expression like x +3y < 4 or 2x 5y 2. They look just like equations except the equal sign is replaced by one of ,,. An inequality does
More informationLinear Equations. Chapter Graphs of Linear Equations
Chapter 1 Linear Equations 1.1 Graphs of Linear Equations An equation involving two variables, say x and y, is simply a way of relating the values of those variables. When the x and y appear outside of
More informationSection 7.2 Linear Programming: The Graphical Method
Section 7.2 Linear Programming: The Graphical Method Man problems in business, science, and economics involve finding the optimal value of a function (for instance, the maimum value of the profit function
More informationSession 7 Bivariate Data and Analysis
Session 7 Bivariate Data and Analysis Key Terms for This Session Previously Introduced mean standard deviation New in This Session association bivariate analysis contingency table covariation least squares
More informationMath 018 Review Sheet v.3
Math 018 Review Sheet v.3 Tyrone Crisp Spring 007 1.1  Slopes and Equations of Lines Slopes: Find slopes of lines using the slope formula m y y 1 x x 1. Positive slope the line slopes up to the right.
More informationLINEAR PROGRAMMING: MODEL FORMULATION AND 21
LINEAR PROGRAMMING: MODEL FORMULATION AND GRAPHICAL SOLUTION 21 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model Example
More informationModule1. x 1000. y 800.
Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,
More informationEQUATIONS and INEQUALITIES
EQUATIONS and INEQUALITIES Linear Equations and Slope 1. Slope a. Calculate the slope of a line given two points b. Calculate the slope of a line parallel to a given line. c. Calculate the slope of a line
More informationLinear Programming: Basic Concepts
Linear Programming: Basic Concepts Table of Contents Three Classic Applications of LP The Wyndor Glass Company Product Mix Problem Formulating the Wyndor Problem on a Spreadsheet The Algebraic Model for
More informationThe Graphical Simplex Method: An Example
The Graphical Simplex Method: An Example Consider the following linear program: Max 4x 1 +3x Subject to: x 1 +3x 6 (1) 3x 1 +x 3 () x 5 (3) x 1 +x 4 (4) x 1, x 0. Goal: produce a pair of x 1 and x that
More informationChapter 1, Operations Research (OR)
Chapter 1, Operations Research (OR) Kent Andersen February 7, 2007 The term Operations Research refers to research on operations. In other words, the study of how to operate something in the best possible
More information3.4. Solving simultaneous linear equations. Introduction. Prerequisites. Learning Outcomes
Solving simultaneous linear equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.
More information1. Graphing Linear Inequalities
Notation. CHAPTER 4 Linear Programming 1. Graphing Linear Inequalities x apple y means x is less than or equal to y. x y means x is greater than or equal to y. x < y means x is less than y. x > y means
More information3.4. Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes
Solving Simultaneous Linear Equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.
More informationLinear Programming Supplement E
Linear Programming Supplement E Linear Programming Linear programming: A technique that is useful for allocating scarce resources among competing demands. Objective function: An expression in linear programming
More information7.5 Systems of Linear Inequalities
7.5 Systems of Linear Inequalities In chapter 6 we discussed linear equations and then saw linear inequalities, so since here, in chapter 7, we are talking about systems of linear equations, it makes sense
More informationPOTENTIAL OUTPUT and LONG RUN AGGREGATE SUPPLY
POTENTIAL OUTPUT and LONG RUN AGGREGATE SUPPLY Aggregate Supply represents the ability of an economy to produce goods and services. In the Longrun this ability to produce is based on the level of production
More informationSolve the linear programming problem graphically: Minimize w 4. subject to. on the vertical axis.
Do a similar example with checks along the wa to insure student can find each corner point, fill out the table, and pick the optimal value. Example 3 Solve the Linear Programming Problem Graphicall Solve
More informationElementary Statistics. Scatter Plot, Regression Line, Linear Correlation Coefficient, and Coefficient of Determination
Scatter Plot, Regression Line, Linear Correlation Coefficient, and Coefficient of Determination What is a Scatter Plot? A Scatter Plot is a plot of ordered pairs (x, y) where the horizontal axis is used
More informationLesson 22: Solution Sets to Simultaneous Equations
Student Outcomes Students identify solutions to simultaneous equations or inequalities; they solve systems of linear equations and inequalities either algebraically or graphically. Classwork Opening Exercise
More informationModule 3 Lecture Notes 2. Graphical Method
Optimization Methods: Linear Programming Graphical Method Module Lecture Notes Graphical Method Graphical method to solve Linear Programming problem (LPP) helps to visualize the procedure explicitly.
More informationGraphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method
The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible
More informationOPRE 6201 : 2. Simplex Method
OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2
More informationHelpsheet. Giblin Eunson Library LINEAR EQUATIONS. library.unimelb.edu.au/libraries/bee. Use this sheet to help you:
Helpsheet Giblin Eunson Library LINEAR EQUATIONS Use this sheet to help you: Solve linear equations containing one unknown Recognize a linear function, and identify its slope and intercept parameters Recognize
More informationEdExcel Decision Mathematics 1
EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation
More informationSimplex Method. Introduction:
Introduction: In the previous chapter, we discussed about the graphical method for solving linear programming problems. Although the graphical method is an invaluable aid to understand the properties of
More information4.3 The Simplex Method and the Standard Maximization Problem
. The Simplex Method and the Standard Maximiation Problem Question : What is a standard maximiation problem? Question : What are slack variables? Question : How do you find a basic feasible solution? Question
More informationPLOTTING DATA AND INTERPRETING GRAPHS
PLOTTING DATA AND INTERPRETING GRAPHS Fundamentals of Graphing One of the most important sets of skills in science and mathematics is the ability to construct graphs and to interpret the information they
More information5.1. Systems of Linear Equations. Linear Systems Substitution Method Elimination Method Special Systems
5.1 Systems of Linear Equations Linear Systems Substitution Method Elimination Method Special Systems 5.11 Linear Systems The possible graphs of a linear system in two unknowns are as follows. 1. The
More informationLinear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables
Linear Inequalities and Linear Programming 5.1 Systems of Linear Inequalities 5.2 Linear Programming Geometric Approach 5.3 Geometric Introduction to Simplex Method 5.4 Maximization with constraints 5.5
More informationInequalities in Two Variables Teacher Notes
Henri Picciotto Inequalities in Two Variables Teacher Notes This unit extends the graphical understanding of systems of equations to inequalities. 1A. Postcards and Letters This activity creates a foundation
More informationUsing Mathematics to Solve Real World Problems
Using Mathematics to Solve Real World Problems Creating a mathematical model: Creating a mathematical model: We are given a word problem Creating a mathematical model: We are given a word problem Determine
More informationSection 1.1 Linear Equations: Slope and Equations of Lines
Section. Linear Equations: Slope and Equations of Lines Slope The measure of the steepness of a line is called the slope of the line. It is the amount of change in y, the rise, divided by the amount of
More informationSolving linear programming problems using the graphical method. COPYRIGHT 2006 by LAVON B. PAGE
Solving linear programming problems using the graphical method Example  designing a diet A dietitian wants to design a breakfast menu for certain hospital patients. The menu is to include two items A
More informationOutline. Linear Programming (LP): Simplex Search. Simplex: An ExtremePoint Search Algorithm. Basic Solutions
Outline Linear Programming (LP): Simplex Search Benoît Chachuat McMaster University Department of Chemical Engineering ChE 4G03: Optimization in Chemical Engineering 1 Basic Solutions
More informationChapter 5.1 Systems of linear inequalities in two variables.
Chapter 5. Systems of linear inequalities in two variables. In this section, we will learn how to graph linear inequalities in two variables and then apply this procedure to practical application problems.
More informationLinear Programming I: Maximization 2009 Samuel L. Baker Assignment 10 is on the last page.
LINEAR PROGRAMMING I 1 Learning objectives: Linear Programming I: Maximization 2009 Samuel L. Baker Assignment 10 is on the last page. 1. Recognize problems that linear programming can handle. 2. Know
More informationSystems of Linear Equations. Suggested Time: 11 Hours
Systems of Linear Equations Suggested Time: 11 Hours Unit Overview Focus and Context In this unit, students will model a situation with a linear system and use the equations to solve a related problem.
More information1. Briefly explain what an indifference curve is and how it can be graphically derived.
Chapter 2: Consumer Choice Short Answer Questions 1. Briefly explain what an indifference curve is and how it can be graphically derived. Answer: An indifference curve shows the set of consumption bundles
More informationEquations of Lines Derivations
Equations of Lines Derivations If you know how slope is defined mathematically, then deriving equations of lines is relatively simple. We will start off with the equation for slope, normally designated
More informationCHAPTER 17. Linear Programming: Simplex Method
CHAPTER 17 Linear Programming: Simplex Method CONTENTS 17.1 AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD Algebraic Properties of the Simplex Method Determining a Basic Solution Basic Feasible Solution 17.2
More informationSEQUENCES ARITHMETIC SEQUENCES. Examples
SEQUENCES ARITHMETIC SEQUENCES An ordered list of numbers such as: 4, 9, 6, 25, 36 is a sequence. Each number in the sequence is a term. Usually variables with subscripts are used to label terms. For example,
More informationLinear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.
1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that
More informationIntroduction to Linear Programming and Graphical Method
Course: COMMERCE (CBCS) Subject: Business Mathematics Lesson: Introduction to Linear Programming and Graphical Method Authors Name: Dr. Gurmeet Kaur, Associate Professor, Daulat Ram College,University
More informationARE211, Fall2012. Contents. 2. Linear Algebra Preliminary: Level Sets, upper and lower contour sets and Gradient vectors 1
ARE11, Fall1 LINALGEBRA1: THU, SEP 13, 1 PRINTED: SEPTEMBER 19, 1 (LEC# 7) Contents. Linear Algebra 1.1. Preliminary: Level Sets, upper and lower contour sets and Gradient vectors 1.. Vectors as arrows.
More informationLINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad
LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA 98481 85073 Hyderabad Page 1 of 19 Question: Explain LPP. Answer: Linear programming is a mathematical technique for determining the optimal allocation of resources
More informationThe Simplex Method. What happens when we need more decision variables and more problem constraints?
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving two decision variables and relatively few problem
More informationSpecial Situations in the Simplex Algorithm
Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the
More informationChapter 1 Linear Programming. Paragraph 2 Developing Ideas for an Algorithm solving Linear Optimization
Chapter 1 Linear Programming Paragraph 2 Developing Ideas for an Algorithm solving Linear Optimization What we did so far How to model an optimization problem Data, Variables, Constraints, Objective We
More informationPPS TI83 Activities Algebra 12 Teacher Notes
PPS TI83 Activities Algebra 12 Teacher Notes It is an expectation in Portland Public Schools that all teachers are using the TI83 graphing calculator in meaningful ways in Algebra 12. This does not
More informationThe revenue function, R(x), is the total revenue realized from the sale of x units of the product.
Linear Cost, Revenue and Profit Functions: If x is the number of units of a product manufactured or sold at a firm then, The cost function, C(x), is the total cost of manufacturing x units of the product.
More informationMathematics Notes for Class 12 chapter 12. Linear Programming
1 P a g e Mathematics Notes for Class 12 chapter 12. Linear Programming Linear Programming It is an important optimization (maximization or minimization) technique used in decision making is business and
More informationvalue is determined is called constraints. It can be either a linear equation or inequality.
Contents 1. Index 2. Introduction 3. Syntax 4. Explanation of Simplex Algorithm Index Objective function the function to be maximized or minimized is called objective function. E.g. max z = 2x + 3y Constraints
More informationLesson Plan Mine Shaft Grade 8 Slope
CCSSM: Grade 8 DOMAIN: Expressions and Equations Cluster: Understand the connections between proportional relationships, lines, and linear equations. Standard: 8.EE.5: Graph proportional relationships,
More informationSensitivity Analysis with Excel
Sensitivity Analysis with Excel 1 Lecture Outline Sensitivity Analysis Effects on the Objective Function Value (OFV): Changing the Values of Decision Variables Looking at the Variation in OFV: Excel One
More informationSlopeIntercept Equation. Example
1.4 Equations of Lines and Modeling Find the slope and the y intercept of a line given the equation y = mx + b, or f(x) = mx + b. Graph a linear equation using the slope and the yintercept. Determine
More informationIntersections of Polar Curves
Intersections of Polar Curves The purpose of this supplement is to find a method for determining where graphs of polar equations intersect each other. Let s start with a fairly straightforward example.
More informationFunctions and straight line graphs. Jackie Nicholas
Mathematics Learning Centre Functions and straight line graphs Jackie Nicholas c 004 University of Sydney Mathematics Learning Centre, University of Sydney 1 Functions and Straight Line Graphs Functions
More informationWhat 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.
PRIMARY CONTENT MODULE Algebra  Linear Equations & Inequalities T37/H37 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
More informationIn this section, we ll review plotting points, slope of a line and different forms of an equation of a line.
Math 1313 Section 1.2: Straight Lines In this section, we ll review plotting points, slope of a line and different forms of an equation of a line. Graphing Points and Regions Here s the coordinate plane:
More informationSYSTEMS OF LINEAR EQUATIONS
SYSTEMS OF LINEAR EQUATIONS Sstems of linear equations refer to a set of two or more linear equations used to find the value of the unknown variables. If the set of linear equations consist of two equations
More information2x  y 4 y 3x  6 y < 2x 5x  3y > 7
DETAILED SOLUTIONS AND CONCEPTS GRAPHICAL REPRESENTATION OF LINEAR INEQUALITIES IN TWO VARIABLES Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu.
More information5.2. Systems of linear equations and their solution sets
5.2. Systems of linear equations and their solution sets Solution sets of systems of equations as intersections of sets Any collection of two or more equations is called a system of equations. The solution
More informationGeneral Equilibrium. The Producers
General Equilibrium In this section we will combine production possibilities frontiers and community indifference curves in order to create a model of the economy as a whole. This brings together producers,
More informationHomework 6 Solution Section 3.2 3.3
Homework 6 Solution Section 3.2 3.3 3.2.10. Use graphical methods to solve the linear programming problem maximizing z = 10x + 8y subject to 2x + 3y 100 5x + 4y 200 x 10 0 y 20. Corner points: (10, 0),
More information(a) Let x and y be the number of pounds of seed and corn that the chicken rancher must buy. Give the inequalities that x and y must satisfy.
MA 44 Practice Exam Justify your answers and show all relevant work. The exam paper will not be graded, put all your work in the blue book provided. Problem A chicken rancher concludes that his flock
More informationEstablishing a mathematical model (Ch. 2): 1. Define the problem, gathering data;
Establishing a mathematical model (Ch. ): 1. Define the problem, gathering data;. Formulate the model; 3. Derive solutions;. Test the solution; 5. Apply. Linear Programming: Introduction (Ch. 3). An example
More information10.1 Systems of Linear Equations: Substitution and Elimination
726 CHAPTER 10 Systems of Equations and Inequalities 10.1 Systems of Linear Equations: Sustitution and Elimination PREPARING FOR THIS SECTION Before getting started, review the following: Linear Equations
More informationAlgebraic expressions are a combination of numbers and variables. Here are examples of some basic algebraic expressions.
Page 1 of 13 Review of Linear Expressions and Equations Skills involving linear equations can be divided into the following groups: Simplifying algebraic expressions. Linear expressions. Solving linear
More informationInsurance. Michael Peters. December 27, 2013
Insurance Michael Peters December 27, 2013 1 Introduction In this chapter, we study a very simple model of insurance using the ideas and concepts developed in the chapter on risk aversion. You may recall
More informationSection Notes 3. The Simplex Algorithm. Applied Math 121. Week of February 14, 2011
Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 14, 2011 Goals for the week understand how to get from an LP to a simplex tableau. be familiar with reduced costs, optimal solutions,
More informationmax cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x
Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study
More informationComponents of LP Problem. Chapter 13. Linear Programming (LP): Model Formulation & Graphical Solution. Introduction. Components of LP Problem (Cont.
Chapter 13 Linear Programming (LP): Model Formulation & Graphical Solution Components of LP Problem Decision Variables Denoted by mathematical symbols that does not have a specific value Examples How much
More informationx x y y Then, my slope is =. Notice, if we use the slope formula, we ll get the same thing: m =
Slope and Lines The slope of a line is a ratio that measures the incline of the line. As a result, the smaller the incline, the closer the slope is to zero and the steeper the incline, the farther the
More informationPreCalculus III Linear Functions and Quadratic Functions
Linear Functions.. 1 Finding Slope...1 Slope Intercept 1 Point Slope Form.1 Parallel Lines.. Line Parallel to a Given Line.. Perpendicular Lines. Line Perpendicular to a Given Line 3 Quadratic Equations.3
More informationElements of a graph. Click on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section Elements of a graph Linear equations and their graphs What is slope? Slope and yintercept in the equation of a line Comparing lines on
More informationSystems of Linear Equations in Two Variables
Chapter 6 Systems of Linear Equations in Two Variables Up to this point, when solving equations, we have always solved one equation for an answer. However, in the previous chapter, we saw that the equation
More information