February 10, 2005
|
|
- Henry Manning
- 5 years ago
- Views:
Transcription
1 February 10, 2005 The Geometry of Linear Programs the geometry of LPs illustrated on DTC Announcement: please turn in homework solutions now with a cover sheet 1
2 Goal of this Lecture 3 mathematical intuitions Algebraic/computational Geometric Economic In this lecture, we focus on 2-dimensional geometry to guide intuition and develop a deeper understanding of linear programs. Use DTC as a running eample 2
3 Data for the DTC Problem Stone Gathering time Slingshot Kits Stone Shields Resources 2 hours 3 hours 100 hours Stone Smoothing 1 hour 2 hours 60 hours Delivery time 1 hour 1 hour 50 hours Demand Profit 3 shekels 5 shekels The DTC problem has two variables. We can learn a lot from its 2 dimensional geometry. 3
4 Formulating the DTC Problem K = number of slingshot kits manufactured S = number of stone shields manufactured Maimize Profit z = 3 K + 5 S Gathering time: Smoothing time: Delivery time: Slingshot demand: Shield demand: Non-negativity: 2 K + 3 S 100 K + 2 S 60 K + S 50 K 40 S 30 K,S 0 4
5 Reformulation K = number of slingshot kits manufactured (in 10s) S = number of stone shields manufactured (in 10s) Maimize Profit z = 3 K + 5 S (in 10s) Gathering time: Smoothing time: Delivery time: Slingshot demand: Shield demand: Non-negativity: 2 K + 3 S 10 K + 2 S 6 K + S 5 K 4 S 3 K,S 0 5
6 Finding an optimal solution Introduce yourself to your partner Try to find an optimal solution to the linear program, without looking ahead. 6
7 Graphing the Feasible Region We will construct and shade the feasible region one or two constraints at a time
8 S Graph the Constraints: 2 K + 3 S 10 K 0, S K + 3 S = K 8
9 Add the Constraint: K + 2 S 6 S K + 2 S = K 9
10 Add the Constraint: K + S 5 S 5 4 K + S = K 10
11 Add the Constraints: K 4; S 3 S We have now graphed the feasible region K 11
12 How do we maimize 3K + 5S? 5 S K 12
13 3 S How do we maimize 3K + 5S? Isoprofit line: the set of solutions to 3K + 5S = a 2 3K + 5S = K + 5S = 7.5 3K + 5S = K 13
14 3 2 S Isoprofit line: the set of solutions to 3K + 5S = a. Adjust parameter a until the isoprofit line is tangent to the feasible region. An optimal solution occurs at a corner point. 3K + 5S = K + 5S = 7.5 3K + 5S = K 14
15 S If we had maimized 2K + 4S, we would have gotten a line segment of optimal solutions. 3 2 Here an optimal solution occurs at two corner points. 2K + 4S = K + 4S = 4 2K + 4S = K 15
16 An Unbounded Feasible Region 5 y Maimize z = 3-5 y y -2-2y 2 0, y 0, Either an optimal solution occurs at a corner point, or else the objective is unbounded from above. 16
17 An Unbounded Feasible Region Maimize z = - 3y Maimize z = 3-5 y 5 4 y The optimum solution is = 2, y = 0. The objective value is unbounded from above. 3-5y = y =
18 What the geometry reveals If the feasible region is bounded, it is polyhedral. That is, it can be enclosed by lines. It is a conve polyhedron. conve not conve Not a linear program 18
19 3 dimensional geometry If the feasible region is bounded, it is polyhedral. in 3D it is enclosed by planes. It is still conve. 19
20 What the geometry reveals If there is an optimal solution, there is an optimal solution that is a corner point. If two points are optimal, then every solution on the line segment joining those points is optimal. 20
21 Review Questions on Geometry Which of the following can be feasible regions for linear programs? A B C D 21
22 Questions on Geometry A B E C If eactly one of these points is optimal for an LP, which point(s) can it be? D If point E is optimum, is it true that all points must be optimum? Is it true that the objective is minimize 0 + 0y? 22
23 More on corner points in 2 dimensions 5 S Maimize z = 3 K + 5 S 2 K + 3 S 10 K + 2 S 6 plus other constraints A constraint is said to be binding if it holds with equality at the optimum solution. Other constraints are non-binding K 23
24 5 4 S Evaluating the optimal solution In two dimensions, a corner point is the intersection of 2 lines. Maimize z = 3 K + 5 S 2 K + 3 S = 10 K + 2 S = Solution: 2 K + 4 S = 12 K = 2; S = 2 z = K 24
25 Net: A Preview of the Simple Algorithm In n dimensions, one cannot evaluate the solution value of every corner (or etreme) point efficiently. (There are too many.) Consider: 0 j 1 for j = 1 to n. There are 2 n different corner points. n=1 n=2 n=3 The simple method finds the best solution by a neighborhood search technique. Two feasible corner points are said to be adjacent if they have one binding constraint in common. 25
26 26.. Neighborhood Search Algorithms Start with a feasible solution Define a neighborhood of Identify an improved neighbor y Replace by y and repeat
27 Preview of the Simple Method 5 4 S Maimize z = 3 K + 5 S Start at any feasible corner point. Move to an adjacent corner point with better objective value. Continue until no adjacent corner point has a better objective value K 27
28 Using Geometry for Sensitivity Analysis Models often are built on data that may or may not be accurate. D ij γ L for ( i, j ) T D γ for ( i, j ) C ij U From model for radiotherapy Sensitivity analysis: vary the data and see the impact on the solutions. Special sensitivity analyses for linear programming. Vary the RHS in a linear manner. Vary the cost in a linear manner. 28
29 Data for the DTC Problem Stone Gathering time Slingshot Kits Stone Shields Resources 2 hours 3 hours 100 hours Stone Smoothing 1 hour 2 hours 60 hours Delivery time 1 hour 1 hour 50 hours Demand Profit 3 shekels 5 shekels Sensitivity analysis. Suppose that one of the town s children volunteers for stone gathering. What is the etra profit (ignoring wages)? Suppose the profit for stone shields is reduced to
30 Sensitivity Analysis in 2D S Suppose the gathering time is increased to What is the impact on the optimal solution value? The shadow price of a constraint is the unit increase in the optimal objective value per unit increase in the RHS of the constraint K 30
31 Sensitivity Analysis in 2D S Solve for the corner point solution as a function of. z = 3 K + 5 S 2 K + 3 S = 10 + K + 2 S = 6 Solution: 2 K + 4 S = 12 S = 2 - K = ; z = 16 + So, the shadow price of gathering time is 1. If we increase gather time by an hour is it worth 1 shekel? (Be careful of units) K 31
32 Sensitivity Analysis Key insights: Optimal solutions occur at corner points. Optimal solutions typically stay optimal for small changes in data We will use these insights to answer several questions on sensitivity analysis. 32
33 Eercise with Partner (4 minutes) The objective value in the transformed model increases by 1 if we increase gathering time from 10 to 11. What is the impact in the original model of increasing gathering time from 100 to 101? What is the impact on the optimal objective value of increasing smoothing time from 6 to 7? What happens if we decrease it from 6 to 4? 33
34 2-Dimensional Sensitivity Analysis S z = 3 K + 5 S 2 K + 3 S = 10 K + 2 S = 6 + Solution: 2 K + 4 S = 12 S = 2 +? K = 2 +? z = 16 +? K 34
35 2-Dimensional Sensitivity Analysis S z = 3 K + 5 S 2 K + 3 S = 10 + K + 2 S = 6 Solution: 2 K + 4 S = 12 S = 2 - K = ; z = 16 + The shadow price is 1. valid in an interval. It is K 35
36 Bounds on RHS coefficients in Sensitivity Analysis Recall that the optimum solution is a corner point, which in 2 dimensions is the solution of 2 equations in 2 variables, and the equations are the binding constraints. Compute the largest changes in the RHS coefficient so that all constraints remain satisfied. 36
37 Sensitivity Analysis: determining the interval K = ; S = 2 - Solver Maimize Profit Gathering time: Smoothing time: Delivery time: Slingshot demand: Shield demand: Non-negativity: z = 3 K + 5 S (in 10s) 2 K + 3 S 10 + K + 2 S 6 K + S 5 K 4 S 3 K,S 0 So, -1 1 z =
38 Summary for changes in RHS coefficients Determine the binding constraints Determine the change in the corner point solution as a function of. Compute the largest and smallest values of so that the solution stays feasible. The shadow price is valid so long as the corner point solution remains optimal, which is so long as it is feasible. If there are three binding constraints, then choose two of these to get the two equations to solve, and the technique still works. (But the shadow prices and ranges depends on which two constraints are chosen.) 38
39 Bounds on Cost coefficients in Sensitivity Analysis Recall that the optimum solution is a corner point, in 2D: 2 binding equations in 2 variables in 2D: it has two neighboring corner points Cost sensitivity: how much can you change the cost coefficient of a variable so that the current corner point solution stays optimal? 39
40 Determining Bounds on Cost Coefficients 5 S Suppose the objective function is changed to z = 3 K + (5 + ) S If = 1, the objective is parallel to K + 2 S = 6 If = -.5, the objective is parallel to 2 K + 3 S = 10 So (2, 2) remains optimal if K + 3 S = 10 K + 2 S = K 40
41 Determining Bounds on Cost Coefficients 5 4 S Suppose the objective function is changed to z = (3 + ) K + 5 S Take two minutes to determine upper and lower bounds on what value d can take so that (2, 2) remains optimal. Solver K + 3 S = 10 K + 2 S = K 41
42 Summary: 2D Geometry helps guide the intuition The Geometry of the Feasible Region Graphing the constraints Finding an optimal solution Graphical method Searching all the etreme points Simple Method Sensitivity Analysis Changing the RHS Changing the Cost Coefficients 42
43 Lecture check problems Section 3.2. Eercises 4 and 6. Section 5.1. Eercises 1, 2, 3, and 4 The solutions will be posted. 43
Chapter 3: Section 3-2 Graphing Linear Inequalities
Chapter : Section - Graphing Linear Inequalities D. S. Malik Creighton Universit, Omaha, NE D. S. Malik Creighton Universit, Omaha, NE Chapter () : Section - Graphing Linear Inequalities / 9 Geometric
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationIntro to Linear Programming. The problem that we desire to address in this course is loosely stated below.
. Introduction Intro to Linear Programming The problem that we desire to address in this course is loosely stated below. Given a number of generators make price-quantity offers to sell (each provides their
More informationLesson 17. Geometry and Algebra of Corner Points
SA305 Linear Programming Spring 2016 Asst. Prof. Nelson Uhan 0 Warm up Lesson 17. Geometry and Algebra of Corner Points Example 1. Consider the system of equations 3 + 7x 3 = 17 + 5 = 1 2 + 11x 3 = 24
More informationGraphing Linear Inequalities in Two Variables.
Many applications of mathematics involve systems of inequalities rather than systems of equations. We will discuss solving (graphing) a single linear inequality in two variables and a system of linear
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationSimplex Method. Introduction:
Introduction: Simple Method 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
More informationOutline. CS38 Introduction to Algorithms. Linear programming 5/21/2014. Linear programming. Lecture 15 May 20, 2014
5/2/24 Outline CS38 Introduction to Algorithms Lecture 5 May 2, 24 Linear programming simplex algorithm LP duality ellipsoid algorithm * slides from Kevin Wayne May 2, 24 CS38 Lecture 5 May 2, 24 CS38
More informationLinear Programming and its Applications
Linear Programming and its Applications Outline for Today What is linear programming (LP)? Examples Formal definition Geometric intuition Why is LP useful? A first look at LP algorithms Duality Linear
More informationLinear Mathematical Programming (LP)
Linear Mathematical Programming (LP) A MP is LP if : The objective function is linear where The set is defined by linear equality or inequality constraints c f T ) = ( ],..., [ n T c c c = = n b A where
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationEcon 172A - Slides from Lecture 2
Econ 205 Sobel Econ 172A - Slides from Lecture 2 Joel Sobel September 28, 2010 Announcements 1. Sections this evening (Peterson 110, 8-9 or 9-10). 2. Podcasts available when I remember to use microphone.
More informationQuestion 2: How do you solve a linear programming problem with a graph?
Question : 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 informationChapter 4 Section 1 Graphing Linear Inequalities in Two Variables
Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Epressions of the tpe + 2 8 and 3 > 6 are called linear inequalities in two variables. A solution of a linear inequalit in two variables
More informationCHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD
CHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD Linear programming is optimization problem where the objective function is linear and all equality and inequality constraints are linear. This problem was first
More informationGraphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved.
Graphical Analysis For problems with 2 variables, we can represent each solution as a point in the plane. The Shelby Shelving model (see the readings book or pp.68-69 of the text) is repeated below for
More informationChapter 3 Linear Programming: A Geometric Approach
Chapter 3 Linear Programming: A Geometric Approach Section 3.1 Graphing Systems of Linear Inequalities in Two Variables y 4x + 3y = 12 4 3 4 x 3 y 12 x y 0 x y = 0 2 1 P(, ) 12 12 7 7 1 1 2 3 x We ve seen
More informationLinear Programming Applications. Software for Linear Programming
Linear Programming Applications Software for Linear Programming Objectives Use of software to solve LP problems MMO Software with eample Graphical Method Simple Method Simple method using optimization
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationLINEAR PROGRAMMING (LP), GRAPHICAL PRESENTATION GASPAR ASAMPANA
LINEAR PROGRAMMING (LP), GRAPHICAL PRESENTATION GASPAR ASAMPANA INTRODUCTION Linear Programming a is combination of a linear objective function and set of linear constraints. The linear constraints express
More informationa) Alternative Optima, b) Infeasible(or non existing) solution, c) unbounded solution.
Unit 1 Lesson 5. : Special cases of LPP Learning Outcomes Special cases of linear programming problems Alternative Optima Infeasible Solution Unboundedness In the previous lecture we have discussed some
More informationLinear Programming. them such that they
Linear Programming l Another "Sledgehammer" in our toolkit l Many problems fit into the Linear Programming approach l These are optimization tasks where both the constraints and the objective are linear
More informationCSE 40/60236 Sam Bailey
CSE 40/60236 Sam Bailey Solution: any point in the variable space (both feasible and infeasible) Cornerpoint solution: anywhere two or more constraints intersect; could be feasible or infeasible Feasible
More informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com 1.0 Introduction Linear programming
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 16: Mathematical Programming I Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 8, 2010 E. Frazzoli
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 50
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 50 CS 473: Algorithms, Spring 2018 Introduction to Linear Programming Lecture 18 March
More informationCME307/MS&E311 Optimization Theory Summary
CME307/MS&E311 Optimization Theory Summary Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/~yyye http://www.stanford.edu/class/msande311/
More information4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1
4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1 Definition: A Linear Programming (LP) problem is an optimization problem: where min f () s.t. X n the
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationINEN 420 Final Review
INEN 420 Final Review Office Hours: Mon, May 2 -- 2:00-3:00 p.m. Tues, May 3 -- 12:45-2:00 p.m. (Project Report/Critiques due on Thurs, May 5 by 5:00 p.m.) Tuesday, April 28, 2005 1 Final Exam: Wednesday,
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More information5.2 Graphing Polynomial Functions
Locker LESSON 5. Graphing Polnomial Functions Common Core Math Standards The student is epected to: F.IF.7c Graph polnomial functions, identifing zeros when suitable factorizations are available, and showing
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationCME307/MS&E311 Theory Summary
CME307/MS&E311 Theory Summary Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/~yyye http://www.stanford.edu/class/msande311/
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 29
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 29 CS 473: Algorithms, Spring 2018 Simplex and LP Duality Lecture 19 March 29, 2018
More informationTuesday, April 10. The Network Simplex Method for Solving the Minimum Cost Flow Problem
. Tuesday, April The Network Simplex Method for Solving the Minimum Cost Flow Problem Quotes of the day I think that I shall never see A poem lovely as a tree. -- Joyce Kilmer Knowing trees, I understand
More informationModelling of LP-problems (2WO09)
Modelling of LP-problems (2WO09) assignor: Judith Keijsper room: HG 9.31 email: J.C.M.Keijsper@tue.nl course info : http://www.win.tue.nl/ jkeijspe Technische Universiteit Eindhoven meeting 1 J.Keijsper
More informationLinear Programming. L.W. Dasanayake Department of Economics University of Kelaniya
Linear Programming L.W. Dasanayake Department of Economics University of Kelaniya Linear programming (LP) LP is one of Management Science techniques that can be used to solve resource allocation problem
More informationChapter 2 An Introduction to Linear Programming
Chapter 2 An Introduction to Linear Programming MULTIPLE CHOICE 1. The maximization or minimization of a quantity is the a. goal of management science. b. decision for decision analysis. c. constraint
More informationMathematics for Business and Economics - I. Chapter7 Linear Inequality Systems and Linear Programming (Lecture11)
Mathematics for Business and Economics - I Chapter7 Linear Inequality Systems and Linear Programming (Lecture11) A linear inequality in two variables is an inequality that can be written in the form Ax
More informationModule 4 Lecture Notes 1. Use of software for solving linear programming problems
Optimization Methods: Linear Programming Applications Software Module 4 Lecture Notes Use of software for solving linear programming problems Introduction In this class, use of software to solve linear
More informationLinear Programming: Introduction
CSC 373 - Algorithm Design, Analysis, and Complexity Summer 2016 Lalla Mouatadid Linear Programming: Introduction A bit of a historical background about linear programming, that I stole from Jeff Erickson
More informationLesson 08 Linear Programming
Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationIntroduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization
Introduction to Linear Programming Algorithmic and Geometric Foundations of Optimization Optimization and Linear Programming Mathematical programming is a class of methods for solving problems which ask
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)
More information5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY
5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves
More informationBCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.
Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method
More informationLecture 9: Linear Programming
Lecture 9: Linear Programming A common optimization problem involves finding the maximum of a linear function of N variables N Z = a i x i i= 1 (the objective function ) where the x i are all non-negative
More informationDesign and Analysis of Algorithms (V)
Design and Analysis of Algorithms (V) An Introduction to Linear Programming Guoqiang Li School of Software, Shanghai Jiao Tong University Homework Assignment 2 is announced! (deadline Apr. 10) Linear Programming
More informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
More informationLINEAR PROGRAMMING. Chapter Overview
Chapter 12 LINEAR PROGRAMMING 12.1 Overview 12.1.1 An Optimisation Problem A problem which seeks to maximise or minimise a function is called an optimisation problem. An optimisation problem may involve
More informationDiscuss mainly the standard inequality case: max. Maximize Profit given limited resources. each constraint associated to a resource
Sensitivity Analysis Discuss mainly the standard inequality case: ma s.t. n a i, z n b, i c i,, m s.t.,,, n ma Maimize Profit given limited resources each constraint associated to a resource Alternate
More informationThree Dimensional Geometry. Linear Programming
Three Dimensional Geometry Linear Programming A plane is determined uniquely if any one of the following is known: The normal to the plane and its distance from the origin is given, i.e. equation of a
More informationIntroduction to Linear Programming
Introduction to Linear Programming Eric Feron (updated Sommer Gentry) (updated by Paul Robertson) 16.410/16.413 Historical aspects Examples of Linear programs Historical contributor: G. Dantzig, late 1940
More informationLinear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.
University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall
More informationOutline. Linear Programming (LP): Principles and Concepts. Need for Optimization to Get the Best Solution. Linear Programming
Outline Linear Programming (LP): Principles and oncepts Motivation enoît hachuat Key Geometric Interpretation McMaster University Department of hemical Engineering 3 LP Standard Form
More information2.1. Definition: If a < b, then f(a) < f(b) for every a and b in that interval. If a < b, then f(a) > f(b) for every a and b in that interval.
1.1 Concepts: 1. f() is INCREASING on an interval: Definition: If a < b, then f(a) < f(b) for every a and b in that interval. A positive slope for the secant line. A positive slope for the tangent line.
More informationMathematics. Linear Programming
Mathematics Linear Programming Table of Content 1. Linear inequations. 2. Terms of Linear Programming. 3. Mathematical formulation of a linear programming problem. 4. Graphical solution of two variable
More informationWEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)
WEEK 4 REVIEW Graphing Systems of Linear Inequalities (3.1) Linear Programming Problems (3.2) Checklist for Exam 1 Review Sample Exam 1 Graphing Linear Inequalities Graph the following system of inequalities.
More informationLinear Programming Motivation: The Diet Problem
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Network Flows & Applications NP-completeness Now Linear Programming and the Simplex Method Hung Q. Ngo (SUNY at Buffalo) CSE 531 1
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationThese notes are in two parts: this part has topics 1-3 above.
IEEM 0: Linear Programming and Its Applications Outline of this series of lectures:. How can we model a problem so that it can be solved to give the required solution 2. Motivation: eamples of typical
More information3.3 Function minimization
3.3. Function minimization 55 3.3 Function minimization Beneath the problem of root-finding, minimizing functions constitutes a major problem in computational economics. Let f () : X R a function that
More informationLINEAR PROGRAMMING INTRODUCTION 12.1 LINEAR PROGRAMMING. Three Classical Linear Programming Problems (L.P.P.)
LINEAR PROGRAMMING 12 INTRODUCTION ou are familiar with linear equations and linear inequations in one and two variables. They can be solved algebraically or graphically (by drawing a line diagram in case
More informationArtificial Intelligence
Artificial Intelligence Combinatorial Optimization G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/34 Outline 1 Motivation 2 Geometric resolution
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.
Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide
More informationLinear Optimization. Andongwisye John. November 17, Linkoping University. Andongwisye John (Linkoping University) November 17, / 25
Linear Optimization Andongwisye John Linkoping University November 17, 2016 Andongwisye John (Linkoping University) November 17, 2016 1 / 25 Overview 1 Egdes, One-Dimensional Faces, Adjacency of Extreme
More informationLinear programming II João Carlos Lourenço
Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,
More informationLinear Programming. ICM Unit 3 Day 1 Part 1
Linear Programming ICM Unit 3 Day 1 Part 1 Arrival: Tools of the Trade Pencils Grab a couple to SHARE with your partner. Graph Paper Two pieces per student for today. Ruler One per student. Get out a NEW
More information1.1 What is Microeconomics?
1.1 What is Microeconomics? Economics is the study of allocating limited resources to satisfy unlimited wants. Such a tension implies tradeoffs among competing goals. The analysis can be carried out at
More informationFarming Example. Lecture 22. Solving a Linear Program. withthe Simplex Algorithm and with Excel s Solver
Lecture 22 Solving a Linear Program withthe Simplex Algorithm and with Excel s Solver m j winter, 2 Farming Example Constraints: acreage: x + y < money: x + 7y < 6 time: x + y < 3 y x + y = B (, 8.7) x
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010
More information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationHere are some guidelines for solving a linear programming problem in two variables in which an objective function is to be maximized or minimized.
Appendi F. Linear Programming F F. Linear Programming Linear Programming: A Graphical Approach Man applications in business and economics involve a process called optimization, in which ou are asked to
More informationFinite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
More informationRead: H&L chapters 1-6
Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research Fall 2006 (Oct 16): Midterm Review http://www-scf.usc.edu/~ise330
More informationThe Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014
The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014 Name TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1)
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationChapter 13-1 Notes Page 1
Chapter 13-1 Notes Page 1 Constrained Optimization Constraints We will now consider how to maximize Sales Revenue & Contribution Margin; or minimize costs when dealing with limited resources (constraints).
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationLet us start with a quick revision of algebra and how to work with variables. Now let us look at the simpler topic, namely Substitution.
Section F Algebra & Equations Objective In this section, we will be dealing with solving equations for the variable involved, manipulating formulae to get one variable as the subject of the formula and
More informationPolyhedral Compilation Foundations
Polyhedral Compilation Foundations Louis-Noël Pouchet pouchet@cse.ohio-state.edu Dept. of Computer Science and Engineering, the Ohio State University Feb 15, 2010 888.11, Class #4 Introduction: Polyhedral
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationCHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS
Linear programming is a mathematical technique for finding optimal solutions to problems that can be expressed using linear equations and inequalities. If a real-world problem can be represented accurately
More information3x + y 50. y=10. x=15 3x+y=50. 2x + 3y = 40
Section 3.3: Linear programming: A geometric approach In addition to constraints, linear programming problems usually involve some quantity to maximize or minimize such as profits or costs. The quantity
More informationSystems of Equations and Inequalities. Copyright Cengage Learning. All rights reserved.
5 Systems of Equations and Inequalities Copyright Cengage Learning. All rights reserved. 5.5 Systems of Inequalities Copyright Cengage Learning. All rights reserved. Objectives Graphing an Inequality Systems
More informationReal life Problem. Review
Linear Programming The Modelling Cycle in Decision Maths Accept solution Real life Problem Yes No Review Make simplifying assumptions Compare the solution with reality is it realistic? Interpret the solution
More informationIn other words, we want to find the domain points that yield the maximum or minimum values (extrema) of the function.
1 The Lagrange multipliers is a mathematical method for performing constrained optimization of differentiable functions. Recall unconstrained optimization of differentiable functions, in which we want
More informationChapter 4 Linear Programming
Chapter Objectives Check off these skills when you feel that you have mastered them. From its associated chart, write the constraints of a linear programming problem as linear inequalities. List two implied
More informationChapter 7. Linear Programming Models: Graphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian
More informationEcon 172A - Slides from Lecture 8
1 Econ 172A - Slides from Lecture 8 Joel Sobel October 23, 2012 2 Announcements Important: Midterm seating assignments. Posted tonight. Corrected Answers to Quiz 1 posted. Quiz 2 on Thursday at end of
More informationLinear Programming Duality and Algorithms
COMPSCI 330: Design and Analysis of Algorithms 4/5/2016 and 4/7/2016 Linear Programming Duality and Algorithms Lecturer: Debmalya Panigrahi Scribe: Tianqi Song 1 Overview In this lecture, we will cover
More informationISE 203 OR I. Chapter 3 Introduction to Linear Programming. Asst. Prof. Dr. Nergiz Kasımbeyli
ISE 203 OR I Chapter 3 Introduction to Linear Programming Asst. Prof. Dr. Nergiz Kasımbeyli 1 Linear Programming 2 An Example 3 The Data Gathered 4 Definition of the Problem Determine what the production
More informationEcon 172A - Slides from Lecture 9
1 Econ 172A - Slides from Lecture 9 Joel Sobel October 25, 2012 2 Announcements Important: Midterm seating assignments. Posted. Corrected Answers to Quiz 1 posted. Midterm on November 1, 2012. Problems
More information