ISE 203 OR I. Chapter 3 Introduction to Linear Programming. Asst. Prof. Dr. Nergiz Kasımbeyli
|
|
- Dwight Williamson
- 5 years ago
- Views:
Transcription
1 ISE 203 OR I Chapter 3 Introduction to Linear Programming Asst. Prof. Dr. Nergiz Kasımbeyli 1
2 Linear Programming 2
3 An Example 3
4 The Data Gathered 4
5 Definition of the Problem Determine what the production rates should be for the two products in order to maximize their total profit, subject to the restrictions imposed by the limited production capacities available in the three plants. 5
6 Data for the Problem 6
7 Formulation as a Linear Programming Decision Variables: Model x 1 = number of batches of product 1 produced per week x 2 = number of batches of product 2 produced per week Objective Function: Maximize Z = total profit per week (in thousands) from producing these two products 7
8 LP Formulation 8
9 Graphical Solution Since the LP has only two decision variables (two dimensions), the problem can be solved graphically. Let s identify the values of x1 and x2 that are permitted by the constraints. Constraint 1: x 1 4 9
10 Constraint 1: The Feasible Region x 1 4 Constraint 2: 2x 2 12 Constraint 3: 3x 1 + 2x 2 = 18 Constraints 4 and 5: x 1 0, x
11 Maximizing the value of Z Slope of the objective function line = -3/5 11
12 Optimal Solution 12
13 The Optimal solution is x 1 = 2, x 2 = 6 with Z = 36. This solution indicates that the Wyndor Glass Co. should produce products 1 and 2 at the rate of 2 batches per week and and 6 batches per week, respectively, with a resulting total profit of $36,000 per week. 13
14 14
15 Standard form of the model 15
16 16
17 17
18 Terminology for Solutions of the Model 18
19 No feasible solution
20 Multiple optimal solutions 20
21 Unbounded objective: No optimal solution 21
22 CPF: Corner-point feasible solution 5 CPF solutions are shown in the figure. Other equivalent terms: Extreme points Vertices 22
23 IMPORTANT: Relationship between CPF solutions and optimal solutions: The best CPF solution must be an optimal solution. If a problem has exactly one optimal solution, it must be a CPF solution. If a problem has multiple optimal solutions, at least two must be CPF solutions. 23
24 24
25 Proportionality assumption 25
26 Proportionality assumption-case 1 26
27 Proportionality assumption-case 2 (increasing marginal return) 27
28 Decreasing marginal return-case 3 28
29 29
30 Z = 3x1 + 5x2 Z = 3x1 + 5x2 + x1x2 Z = 3x1 + 5x2 - x1x2
31 3x 1 + 2x x 1 + 2x x 1 x x 1 + 2x x 12 x 2 18
32 Example: Giapetto s Woodcarving Giapetto s, Inc., manufactures wooden soldiers and trains. Each soldier built: Sell for $27 and uses $10 worth of raw materials. Increase Giapetto s variable labor/overhead costs by $14. Requires 2 hours of finishing labor. Requires 1 hour of carpentry labor. Each train built: Sell for $21 and used $9 worth of raw materials. Increases Giapetto s variable labor/overhead costs by $10. Requires 1 hour of finishing labor. Requires 1 hour of carpentry labor.
33 Each week Giapetto can obtain: All needed raw material. Only 100 finishing hours. Only 80 carpentry hours. Demand for the trains is unlimited. At most 40 soldiers are bought each week. Giapetto wants to maximize weekly profit (revenues costs). Formulate a mathematical model of Giapetto s situation that can be used maximize weekly profit.
34 Solution The Giapetto solution model incorporates the characteristics shared by all linear programming problems. Decision variables should completely describe the decisions to be made. x 1 = number of soldiers produced each week x 2 = number of trains produced each week The decision maker wants to maximize (usually revenue or profit) or minimize (usually costs) some function of the decision variables. This function to maximized or minimized is called the objective function.
35 Solution continued Giapetto s weekly profit can be expressed in terms of the decision variables x 1 and x 2 : Weekly profit = weekly revenue weekly raw material costs the weekly variable costs = 3x 1 + 2x 2 Thus, Giapetto s objective is to chose x 1 and x 2 to maximize weekly profit. The variable z denotes the objective function value of any LP. Giapetto s objective function is Maximize z = 3x 1 + 2x 2 The coefficient of an objective function variable is called an objective function coefficient.
36 Solution continued As x 1 and x 2 increase, Giapetto s objective function grows larger. For Giapetto, the values of x 1 and x 2 are limited by the following three restrictions (constraints): Each week, no more than 100 hours of finishing time may be used. (2 x 1 + x 2 100) Each week, no more than 80 hours of carpentry time may be used. (x 1 + x 2 80) Because of limited demand, at most 40 soldiers should be produced. (x 1 40)
37 The coefficients of the decision variables in the constraints are called the technological coefficients. The number on the right-hand side of each constraint is called the constraint s right-hand side (or rhs). To complete the formulation of a linear programming problem, the following question must be answered for each decision variable. Can the decision variable only assume nonnegative values, or is the decision variable allowed to assume both positive and negative values? If the decision variable can assume only nonnegative values, the sign restriction x i 0 is added. If the variable can assume both positive and negative values, the decision variable x i is unrestricted in sign (often abbreviated urs).
38 Solution continued For the Giapetto problem model, combining the sign restrictions x 1 0 and x 2 0 with the objective function and constraints yields the following optimization model: Max z = 3x 1 + 2x 2 Subject to (s.t.) 2 x 1 + x (finishing constraint) (objective function) x 1 + x 2 80 (carpentry constraint) x 1 40 (constraint on demand for soldiers) x 1 0 (sign restriction) x 2 0 (sign restriction)
39 The set of points satisfying the Giapetto LP is bounded by the five sided polygon DGFEH. Any point on or in the interior of this polygon (the shade area) is in the feasible region. X2 B finishing constraint Feasible Region Optimal solution x 1 =20, x 2 =60 D demand constraint G z = 100 carpentry constraint H F z = 180 z = 60 E A C X1
40 Having identified the feasible region for the Giapetto LP, a search can begin for the optimal solution which will be the point in the feasible region with the largest z-value. To find the optimal solution, graph a line on which the points have the same z-value. In a max problem, such a line is called an isoprofit line while in a min problem, this is called the isocost line. The figure shows the isoprofit lines for z = 60, z = 100, and z = 180.
41 A constraint is binding if the left-hand and righthand side of the constraint are equal when the optimal values of the decision variables are substituted into the constraint. In the Giapetto LP, the finishing and carpentry constraints are binding. A constraint is nonbinding if the left-hand side and the right-hand side of the constraint are unequal when the optimal values of the decision variables are substituted into the constraint. In the Giapetto LP, the demand constraint for wooden soldiers is nonbinding since at the optimal solution (x 1 = 20), x1 < 40.
42 A set of points S is a convex set if the line segment jointing any two pairs of points in S is wholly contained in S. For any convex set S, a point P in S is an extreme point if each line segment that lies completely in S and contains the point P has P as an endpoint of the line segment. The feasible region for the Giapetto LP will be a convex set. X2 B finishing constraint Feasible Region D demand constraint G z = 100 carpentry constraint H F z = 180 z = 60 E A C X1
43 Example: Dorian Auto Dorian Auto manufactures luxury cars and trucks. The company believes that its most likely customers are high-income women and men. To reach these groups, Dorian Auto has embarked on an ambitious TV advertising campaign and will purchase 1-minute commercial spots on two type of programs: comedy shows and football games.
44 Each comedy commercial is seen by 7 million high income women and 2 million high-income men and costs $50,000. Each football game is seen by 2 million high-income women and 12 million high-income men and costs $100,000. Dorian Auto would like for commercials to be seen by at least 28 million high-income women and 24 million high-income men. Use LP to determine how Dorian Auto can meet its advertising requirements at minimum cost.
45 Dorian: Solution Dorian must decide how many comedy and football ads should be purchased, so the decision variables are x 1 = number of 1-minute comedy ads x 2 = number of 1-minute football ads Dorian wants to minimize total advertising cost. Dorian s objective functions is min z = 50 x x 2 Dorian faces the following the constraints Commercials must reach at least 28 million high-income women. (7x 1 + 2x 2 28) Commercials must reach at least 24 million high-income men. (2x x 2 24) The sign restrictions are necessary, so x 1, x 2 0.
46 Solution continued X2 14 B 12 High-income women constraint To solve this LP graphically begin by graphing the feasible region D z = 320 A E Feasible Region (unbounded) z = 600 High-income men constraint C X1
47 Solution continued Like the Giapetto LP, The Dorian LP has a convex feasible region. The feasible region for the Dorian problem, however, contains points for which the value of at least one variable can assume arbitrarily large values. Such a feasible region is called an unbounded feasible region.
48 Solution continued Since Dorian wants to minimize total advertising costs, the optimal solution to the problem is the point in the feasible region with the smallest z value. An isocost line with the smallest z value passes through point E and is the optimal solution at x 1 = 3.4 and x 2 = 1.4. Both the high-income women and high-income men constraints are satisfied, both constraints are binding.
49 Does the Dorian problem meet the four assumptions of linear programming? The Proportionality Assumption is violated because at a certain point advertising will yield diminishing returns. Even though the Additivity Assumption was used in writing: (Total viewers) = (Comedy viewer ads) + (Football ad viewers) many of the same people might view both ads, double-counting of such people would occur thereby violating the assumption. The Divisibility Assumption is violated if only 1- minute commercials are available. Dorian is unable to purchase 3.6 comedy and 1.4 football commercials. The Certainty assumption is also violated because there is no way to know with certainty how many viewers are added by each type of commercial.
50 Example: Diet Problem My diet requires that all the food I get come from one of the four basic food groups. At present, the following four foods are available for consumption: brownies, chocolate ice cream, cola and pineapple cheesecake. Each brownie costs 50, each scoop of ice cream costs 20, each bottle of cola costs 30, and each piece of pineapple cheesecake costs 80. Each day, I must ingest at least 500 calories, 6 oz of chocolate, 10 oz of sugar, and 8 oz of fat. The nutritional content per unit of each food is given. Formulate a linear programming model that can be used to satisfy my daily nutritional requirements at minimum cost.
51 Nutritional Values for Diet Calories Chocolate (ounces) Sugar (ounces) Fat (ounces) Brownie Chocolate Ice Cream (1 scoop) Cola (1 bottle) Pineapple Cheesecake (1 piece)
52 Solution As always, begin by determining the decisions that must be made by the decision maker: how much of each type of food should be eaten daily. Thus we define the decision variables: x 1 = number of brownies eaten daily x 2 = number of scoops of chocolate ice cream eaten daily x 3 = bottles of cola drunk daily x 4 = pieces of pineapple cheesecake eaten daily
53 Solution continued My objective is to minimize the cost of my diet. The total cost of any diet may be determined from the following relation: (total cost of diet) = (cost of brownies) + (cost of ice cream) +(cost of cola) + (cost of cheesecake). The decision variables must satisfy the following four constraints: Daily calorie intake must be at least 500 calories. Daily chocolate intake must be at least 6 oz. Daily sugar intake must be at least 10 oz. Daily fat intake must be at least 8 oz.
54 Solution continued Express each constraint in terms of the decision variables. The optimal solution to this LP is found by combining the objective functions, constraints, and the sign restrictions. (Can you find the solution graphically?) The chocolate and sugar constraints are binding, but the calories and fat constraints are nonbinding. A version of the diet problem with a more realistic list of foods and nutritional requirements was one of the first LPs to be solved by computer.
55 Additional Examples Design of Radiation Therapy
56
57 LP Formulation Decision Variables: x 1 : dose (in kilorads) at the entry point for beam 1 x 2 : dose (in kilorads) at the entry point for beam 1 Minimize Z=0.4x x 2 s.t. 0.3x x x x 2 = 6 0.6x x 2 6 x 1 0, x
58
59 Personnel Scheduling 59
60 The problem is to determine how many agents should be assigned to the respective shifts each day to minimize the total personnel cost for agents. 60
61 LP Formulation: Redundant constraints 61
OPERATIONS RESEARCH LECTURE NOTES
OPERATIONS RESEARCH LECTURE NOTES Y. İlker Topcu, Prof. Dr. Acknowledgements: We would like to acknowledge Prof. W.L. Winston's "Operations Research: Applications and Algorithms" and Prof. J.E. Beasley's
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 informationLinear Programming. Meaning of Linear Programming. Basic Terminology
Linear Programming Linear Programming (LP) is a versatile technique for assigning a fixed amount of resources among competing factors, in such a way that some objective is optimized and other defined conditions
More information1 GIAPETTO S WOODCARVING PROBLEM
1 GIAPETTO S WOODCARVING PROBLEM EZGİ ÇALLI OBJECTIVES CCSS.MATH.CONTENT.HSA.REI.D.12: Graph the solutions to a linear inequality in two variables as a half-plane (excluding the boundary in the case of
More informationIntroduction to Linear Programming. Chapter 3: Hillier and Lieberman Chapter 3: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course
Introduction to Linear Programming Chapter 3: Hillier and Lieberman Chapter 3: Decision Tools for Agribusiness Dr Hurley s AGB 328 Course Terms to Know Simplex Method, Feasible Region, Slope- Intercept
More informationMULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM2046 ENGINEERING MATHEMATICS IV TUTORIAL
A. Linear Programming (LP) MULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM046 ENGINEERING MATHEMATICS IV TUTORIAL. Identify the optimal solution and value: (a) Maximize f = 0x + 0 x (b) Minimize f = 45x
More informationECE 307- Techniques for Engineering Decisions
ECE 307- echniques for Engineering Decisions Dualit Concepts in Linear Programming George Gross Department of Electrical and Computer Engineering Universit of Illinois at Urbana-Champaign ECE 307 2006
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 informationGiapetto s Woodcarving Problem
MTE 503-1 Computer Technology in Mathematics Education TI Worksheet Ezgi ÇALLI Class level: 9-10 Objectives: IGCSE (0607-Extended, 2014): (Extension to) 7.7. Linear inequalities on the Cartesian plane
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 informationFull file at https://fratstock.eu. Linear Programming Models: Graphical and Computer Methods
Chapter 2: Linear Programming Models: Graphical and Computer Methods Multiple Choice 1. Consider the following linear programming model: Max X 1 2 + X 2 + 3X 3 X 1 + X 2 3 X 1 + X 2 1 This problem violates
More informationGetting things done in Python
Getting things done in Python Remigiusz Modrzejewski February 28, 2012 N 1 / 18 Why bother? Comparing to Java: Easier setup No compilation Programs are shorter Code resembles mathematical formulation Comparing
More informationAssignment #3 - Solutions MATH 3300A (01) Optimization Fall 2015
Assignment #3 - Solutions MATH 33A (1) Optimization Fall 15 Section 6.1 1. Typical isoprofit line is 3x 1 +c x =z. This has slope -3/c. If slope of isoprofit line is
More informationQuantitative Technique
Quantitative Technique Subject Course Code Number : MMAS 521 : Optimization Techniques for Managerial Decisions Instructor : Dr. Umesh Rajopadhyaya Credit Hours : 2 Main Objective : The objective of the
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 informationChapter 2 - An Introduction to Linear Programming
True / False 1. Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution. TOPICS: Introduction 2. In a linear programming problem, the objective function
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 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 informationChapter 2--An Introduction to Linear Programming
Chapter 2--An Introduction to Linear Programming 1. The maximization or minimization of a quantity is the A. goal of management science. B. decision for decision analysis. C. constraint of operations research.
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 informationSetup and graphical solution of Linear Programming Problems [2-variables] Mathematical Programming Characteristics
Setup and graphical solution of Linear Programming Problems [2-variables] Mathematical Programming Characteristics Decisions must be made on the levels of a two or more activities. The levels are represented
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 informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 1 Why LP? Linear programming (LP, also called linear
More informationUNIT 3 LINEAR PROGRAMMING GRAPHICAL METHOD
UNIT 3 LINEAR PROGRAMMING GRAPHICAL METHOD Objectives After studying this unit, you should be able to : Formulate management problem as a linear programming problem in suitable cases identify the characteristics
More informationLinear Programming: Basic Concepts. Chapter 2: Hillier and Hillier
Linear Programming: Basic Concepts Chapter 2: Hillier and Hillier Agenda Define Linear Programming The Case of the Wyndor Glass Co. A Maximization Problem Developing a Mathematical Representation of Wyndor
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 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 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 information3. Decision variables are represented in both the objective function and the constraints while formulating a linear program.
Supplement E Supplement E Linear Programming Linear Programming TRUE/FALSE 1. Linear programming is useful for allocating scarce resources among competing demands. Answer: True Reference: Introduction
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 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: Model Formulation and Graphical Solution
Linear Programming: Model Formulation and Graphical Solution Chapter 2 2-1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
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 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 informationLinear Programming: Model Formulation and Graphical Solution
Linear Programming: Model Formulation and Graphical Solution Chapter 2 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model
More informationAlgebra Reviews & LP Graphic Solutions
Algebra Reviews & LP Graphic Solutions Given Constraints to Draw Straight Lines and Identify Feasible Region Draw Straight Lines for Each Constraint: From Equ(1), Set X = 0, Y = 3, a(0, 3); Set Y = 0,
More information1. Evaluating the objective function at each of the corner points we obtain the following table. Vertex Z = 2x + 3y (1,1) 5 (8,5) 31 (4,9) 35 (2,8) 28
3.3 CONCEPT QUESTIONS, page 192 1. a. The feasible set is the set of points satisfying the constraints associated with the linear programming problem. b. A feasible solution of a linear programming problem
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 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 informationIntroduction to Linear Programing Problems
Paper: Linear Programming and Theory of Games Lesson: Introduction to Linear Programing Problems Lesson Developers: DR. MANOJ KUMAR VARSHNEY, College/Department: Department of Statistics, Hindu College,
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 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 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 informationLinear Programming Problems
Linear Programming Problems Linear inequalities are important because we often want to minimize or maximize a quantity (called the objective function) subject to certain constraints (linear inequalities).
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 informationIntroduction to Linear Programming
Introduction to Linear Programming Linear Programming Applied mathematics is all about applying mathematical techniques to understand or do something practical. Optimization is all about making things
More informationOPTIMUM DESIGN. Dr. / Ahmed Nagib Elmekawy. Lecture 3
OPTIMUM DESIGN Dr. / Ahmed Nagib Elmekawy Lecture 3 1 Graphical Solution 1. Sketch coordinate system 2. Plot constraints 3. Determine feasible region 4. Plot f(x) contours 5. Find opt solution x* & opt
More informationFebruary 10, 2005
15.053 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 Goal of this Lecture 3 mathematical
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationSEN301 OPERATIONS RESEARCH I PREVIUOS EXAM QUESTIONS
SEN30 OPERATIONS RESEARCH I PREVIUOS EXAM QUESTIONS. A company is involved in the production of two items (X and Y). The resources need to produce X and Y are twofold, namely machine time for automatic
More informationLinear Programming. Formulation and Graphical Solution
Linear Programming Formulation and Graphical Solution A Two Variable Model Simple LP with two decision variables Two dimensional model is hardly useful in the real world systems which normally encompass
More informationUNIT 2 LINEAR PROGRAMMING PROBLEMS
UNIT 2 LINEAR PROGRAMMING PROBLEMS Structure 2.1 Introduction Objectives 2.2 Linear Programming Problem (LPP) 2.3 Mathematical Formulation of LPP 2.4 Graphical Solution of Linear Programming Problems 2.5
More informationLinear Programming Problems: Geometric Solutions
Linear Programming Problems: Geometric s Terminology Linear programming problems: problems where we must find the optimum (minimum or maximum) value of a function, subject to certain restrictions. Objective
More informationExample Graph the inequality 2x-3y 12. Answer - start with the = part. Graph the line 2x - 3y = 12. Linear Programming: A Geometric Approach
Linear Programming: A Geometric Approach 3.1: Graphing Systems of Linear Inequalities in Two Variables Example Graph the inequality 2x-3y 12. Answer - start with the = part. Graph the line 2x - 3y = 12.
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 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 informationCHAPTER 4 Linear Programming with Two Variables
CHAPTER 4 Linear Programming with Two Variables In this chapter, we will study systems of linear inequalities. They are similar to linear systems of equations, but have inequalitites instead of equalities.
More informationISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX
ISE203 Optimization 1 Linear Models Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX Simplex method is an algebraic procedure However, its underlying concepts are geometric Understanding
More informationSection Graphing Systems of Linear Inequalities
Section 3.1 - Graphing Systems of Linear Inequalities Example 1: Find the graphical solution of the inequality y x 0. Example 2: Find the graphical solution of the inequality 5x 3y < 15. 1 Example 3: Determine
More informationResource Allocation (p. 254)
Linear Optimization 4.2 120 Resource Allocation (p. 254) Determine the linear program corresponding to the following problem. A farmer has set aside 18 acres of land to be used entirely for plots of grapes,
More informationCHAPTER 12: LINEAR PROGRAMMING
CHAPTER 12: LINEAR PROGRAMMING Previous Years Board Exam (Important Questions & Answers) MARKS WEIGHTAGE 06 marks 1. A cottage industry manufactures pedestal lamps and wooden shades, each requiring the
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 informationLinear Programming Problems
Linear Programming Problems Two common formulations of linear programming (LP) problems are: min Subject to: 1,,, 1,2,,;, max Subject to: 1,,, 1,2,,;, Linear Programming Problems The standard LP problem
More informationLinear Programming: A Geometric Approach
Chapter 3 Linear Programming: A Geometric Approach 3.1 Graphing Systems of Linear Inequalities in Two Variables The general form for a line is ax + by + c =0. The general form for a linear inequality is
More informationA Real Life Application of Linear Programming
Dagon University Research Journal 2012, Vol. 4 A Real Life Application of Linear Programming Win Win Myo * Abstract Linear programming is heavily used in microeconomics and company management, such as
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 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 informationUnconstrained Optimization Principles of Unconstrained Optimization Search Methods
1 Nonlinear Programming Types of Nonlinear Programs (NLP) Convexity and Convex Programs NLP Solutions Unconstrained Optimization Principles of Unconstrained Optimization Search Methods Constrained Optimization
More informationLinear Programming Terminology
Linear Programming Terminology The carpenter problem is an example of a linear program. T and B (the number of tables and bookcases to produce weekly) are decision variables. The profit function is an
More informationIntroduction to Management Science, 12e (Taylor) Chapter 2 Linear Programming: Model Formulation and Graphical Solution
Introduction to Management Science, 12e (Taylor) Chapter 2 Linear Programming: Model Formulation and Graphical Solution 1) Linear programming is a model consisting of linear relationships representing
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 informationUNIT 6 MODELLING DECISION PROBLEMS (LP)
UNIT 6 MODELLING DECISION This unit: PROBLEMS (LP) Introduces the linear programming (LP) technique to solve decision problems 1 INTRODUCTION TO LINEAR PROGRAMMING A Linear Programming model seeks to maximize
More informationAdvanced Algorithms Linear Programming
Reading: Advanced Algorithms Linear Programming CLRS, Chapter29 (2 nd ed. onward). Linear Algebra and Its Applications, by Gilbert Strang, chapter 8 Linear Programming, by Vasek Chvatal Introduction to
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 informationLinear Programming & Graphic Solution. Dr. Monther Tarawneh
Linear Programming & Graphic Solution Dr. Monther Tarawneh In this Lecture This topic concentrates on model formulation and computations in linear programming (LP). To illustrate the use of LP, real world
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 informationAMATH 383 Lecture Notes Linear Programming
AMATH 8 Lecture Notes Linear Programming Jakob Kotas (jkotas@uw.edu) University of Washington February 4, 014 Based on lecture notes for IND E 51 by Zelda Zabinsky, available from http://courses.washington.edu/inde51/notesindex.htm.
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 informationLinear Programming. Linear Programming. Linear Programming. Example: Profit Maximization (1/4) Iris Hui-Ru Jiang Fall Linear programming
Linear Programming 3 describes a broad class of optimization tasks in which both the optimization criterion and the constraints are linear functions. Linear Programming consists of three parts: A set of
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 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 informationOptimization. A first course on mathematics for economists Problem set 6: Linear programming
Optimization. A first course on mathematics for economists Problem set 6: Linear programming Xavier Martinez-Giralt Academic Year 2015-2016 6.1 A company produces two goods x and y. The production technology
More informationProblem Set 2 Geometry, Algebra, Reality
Problem Set 2 Geometry, Algebra, Reality Applied Mathematics 121 Spring 2011 Due 5:00 PM, Friday, February 11, 2011 Announcements The assignment is due by 5:00 PM, Friday, February 11, 2011. Readings:
More informationThese definitions are only useful within the graphical solution of LP models. Thus, a more general definition is required.
BUAD 403 OPERATIONAL RESEARCH I LECTURE IV HAND OUT Binding Constraints & Non-Binding Constraints: Binding Constraints: are the constraints that intersect on the optimum solution point. Non-Binding Constraints:
More informationII. Linear Programming
II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative
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 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 3: Towards the Simplex Method for Efficient Solution of Linear Programs
Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs The simplex method, invented by George Dantzig in 1947, is the basic workhorse for solving linear programs, even today. While
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 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 informationCHAPTER 12: LINEAR PROGRAMMING
CHAPTER 12: LINEAR PROGRAMMING MARKS WEIGHTAGE 06 marks NCERT Important Questions & Answers 1. Determine graphically the minimum value of the objective function Z = 50x + 20y subject to the constraints:
More informationLP Graphic Solution & Solver for LP
LP Graphic Solution & Excel@ Solver for LP 5X + 3Y = 0 (3) Draw the objective function line on the graph: Any (including the optimal) LP solution has to be part of
More informationChapter 9: Integer Programming
Chapter 9: Integer Programming ١ Learning Objectives (see p. 382) After completing this chapter, you should be able to: How Integer Programming (IP) differs from LP Describe how general IP problems arise
More informationUnit 0: Extending Algebra 1 Concepts
1 What is a Function? Unit 0: Extending Algebra 1 Concepts Definition: ---Function Notation--- Example: f(x) = x 2 1 Mapping Diagram Use the Vertical Line Test Interval Notation A convenient and compact
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
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 informationPrepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.
Prepared By Handaru Jati, Ph.D Universitas Negeri Yogyakarta handaru@uny.ac.id Chapter 8 Using The Excel Solver To Solve Mathematical Programs Chapter Overview 8.1 Introduction 8.2 Formulating Mathematical
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 informationChapter 4. Linear Programming
Chapter 4 Linear Programming For All Practical Purposes: Effective Teaching Occasionally during the semester remind students about your office hours. Some students can perceive that they are bothering
More information