Operations Research Solving LPs. Dr. Özgür Kabak
|
|
- Whitney Willis
- 7 years ago
- Views:
Transcription
1 Operations Research Solving LPs Dr. Özgür Kabak
2 Solving LPs } The Graphical Solution } The Simplex Algorithm } Software } Lindo } Excel Solver } QM for Windows 2
3 LP Solutions: Four Cases } The LP has a unique optimal solution. } The LP has alternative (multiple) optimal solutions. } It has more than one (actually an infinite number of) optimal solutions. } The LP is infeasible. } It has no feasible solutions. The feasible region contains no points. } The LP is unbounded. } In the feasible region there are points with arbitrarily large (in a max problem) objective function values. 3
4 The Graphical Solution } Any LP with only two variables can be solved graphically. X X
5 The Graphical Solution Giapetto Example } Giapetto Example } Since the Giapetto LP has two variables, it may be solved graphically. } The feasible region is the set of all points satisfying the constraints. max z = 3x 1 + 2x 2 s.t. 2x 1 + x (Finishing constraint) x 1 + x 2 80 (Carpentry constraint) x 1 40 (Demand constraint) x 1, x 2 0 (Sign restrictions) 5
6 6 The set of points satisfying the 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.
7 Isoprofit / Isocost } Having identified the feasible region for the LP, a search can begin for the optimal solution which will be the point in the feasible region with the largest z-value (maximization problem). } 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)
8 Binding } A constraint is binding (active, tight) if the left-hand and right-hand side of the constraint are equal when the optimal values of the decision variables are substituted into the constraint. } The finishing and carpentry constraints are binding. } A constraint is nonbinding (inactive) if the left-hand side and the righthand side of the constraint are unequal when the optimal values of the decision variables are substituted into the constraint. } The demand constraint for wooden soldiers is nonbinding since at the optimal solution x 1 < 40 (x 1 = 20).
9 Basic Variables } Nonbasic variable } a chosen set of variables where variables equal to 0 } Basic variable } the remaining variables that satisfy the system of equations at the standard form
10 Advertisement Example (Winston 3.2, p.61) } Since the Advertisement LP has two variables, it may be solved graphically. } The feasible region is the set of all points satisfying the constraints. min z =50x x 2 s.t. 7x 1 + 2x 2 28 (high income women) 2x x 2 24 x 1,x 2 0 (high income men) 10
11 11
12 Advertisement Example Solution } 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.6 and x 2 = 1.4 giving z = 320 } Both the high-income women and high-income men constraints are satisfied, both constraints are binding. } x 1 and x 2 are basic variables 12
13 Two Mines Example } min 180x + 160y } S.t. } 6x + y >= 12 } 3x + y >= 8 } 4x + 6y >= 24 } x <= 5 } y <= 5 } x,y >= 0 13
14 14
15 Modified Giapetto (1) } maks z = 4x 1 + 2x 2 } s.t. } 2x 1 + x (Finishing constraint) } x 1 + x 2 80 (Carpentry constraint) } x 1 40 (Demand constraint) } x 1, x 2 0 (Sign restrictions) 15
16 Points on the line between points G (20, 60) and F (40, 20) are the alternative optimal solutions. (z=200) 16 Thus, for 0 c 1, c [20 60] + (1-c) [40 20] = [40-20c, 20+40c] will be optimal
17 Modified Giapetto (2) } max z = 3x1 + 2x2 } s.t. } 2x1 + x2 100 (Finishing constraint) } x1 + x2 80 (Carpentry constraint) } x1 40 (Soldier Demand constraint) } x2 90 (Train demand constraint) } x1, x2 0 (Sign restrictions) 17
18 No points satisfy all constraints Infeasible LP 18
19 Modified Giapetto (3) } max z = 3x1 + 2x2 } s.t. } 2x1 + x2 100 (Finishing constraint) } x1 + x2 80 (Carpentry constraint) } x1 40 (Soldier Demand constraint) } x2 90 (Train demand constraint) } x1, x2 0 (Sign restrictions) 19
20 90 x 2 Isoprofit line never lose contact with the feasible region: Unbounded LP! H 40 x 1 20
21 Wyndor Glass Example } The WYNDOR GLASS CO. produces high-quality glass products, including windows and glass doors. It has three plants. Aluminum frames and hardware are made in Plant 1, wood frames are made in Plant 2, and Plant 3 produces the glass and assembles the products. } Because of declining earnings, top management has decided to revamp the company s product line. Unprofitable products are being discontinued, releasing production capacity to launch two new products having large sales potential: } Product 1: An 8-foot glass door with aluminum framing } Product 2: A 4 6 foot double-hung wood-framed window } Product 1 requires some of the production capacity in Plants 1 and 3, but none in Plant 2. Product 2 needs only Plants 2 and 3. The marketing division has concluded that the company could sell as much of either product as could be produced by these plants. However, because both products would be competing for the same production capacity in Plant 3, it is not clear which mix of the two products would be most profitable. } Suppose that the new products had been required to return a net profit of at least $50,000 per week to justify discontinuing part of the current product line. TABLE 3.1 Data for the Wyndor Glass Co. problem Production Time per Batch, Hours Product Production Time Plant 1 2 Available per Week, Hours Profit per batch $3,000 $5,000
22 Wyndor Glass Example - Solution x x 1 5x 2 50 Maximize Z 3x 1 5x 2, subject to x 1 4 2x 2 3x 1 2x 2 3x 1 5x and x 1 0, x x x 1 2x x 1 0 x 2 0 x x 1
23 Operations Research Sensitivity Analysis Dr. Özgür Kabak
24 Reduced Cost } The reduced cost for any nonbasic variable: } the amount by which the nonbasic variable's objective function coefficient must be improved } before that variable will become a basic variable in some optimal solution to the LP. } If the objective function coefficient of a nonbasic variable x k is improved by its reduced cost, } then the LP will have alternative optimal solutions } at least one in which x k is a basic variable, } and at least one in which x k is not a basic variable.
25 Reduced Cost } If the objective function coefficient of a nonbasic variable x k is improved by more than its reduced cost, } then any optimal solution to the LP will have x k as a basic variable (x k >0). } Reduced cost of a basic variable is zero (see definition)!
26 Shadow Price } The shadow price for the ith constraint } the amount by which the optimal z value is "improved" (increased in a max problem and decreased in a min problem) } if the RHS of the ith constraint is increased by 1. } This definition applies only if the change in the RHS of the constraint leaves the current basis optimal! } A constraint will always have a nonpositive shadow price; } A constraint will always have a nonnegative shadow price.
27 Conceptualization max z = 6 x 1 + x x 3 x 1 + x x 2 1 All variables 0 This is a very easy LP model and can be solved manually without utilizing Simplex. } x 2 = 1 } x 1 = 0, x 3 = 100 } The optimal solution: z = 1001, [x 1, x 2, x 3 ] = [0, 1, 100]
28 Conceptualization max z = 6 x 1 + x x 3 x 1 + x x 2 1 All variables 0 Similarly, sensitivity analysis can be executed manually. } Reduced Cost } As x 2 and x 3 are in the basis, their reduced costs are 0. } Reduced cost of x 1 is equal to 4 (10-6). } Shadow Price } If the RHS of the first constraint is increased by 1, new optimal solution of x3 would be 101 instead of 100. } new z value would be } If we use the definition: = 10 is the shadow price of the first constraint. } The shadow price of the second constraint is 1.
29 Utilizing Lindo Output MAX 6 X1 + X X3 SUBJECT TO 2) X1 + X3 <= 100 3) X2 <= 1 END LP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE 1) NOTICE: The objective function which is regarded as Row 0 in Simplex is accepted as Row 1 in Lindo. Therefore the first constraint of the model is always second row in Lindo!!! VARIABLE VALUE REDUCED COST X X X ROW SLACK OR SURPLUS DUAL PRICES 2) )
30 Utilizing Lindo Output RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X INFINITY X INFINITY X INFINITY RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE INFINITY INFINITY
31 Utilizing Lindo Output } Lindo output reveals the reduced costs of x 1, x 2, and x 3 as 4, 0, and 0 respectively. } In the maximization problems, the reduced cost of a nonbasic variable can also be read from the allowable increase value of that variable at obj. coefficient ranges. Here, the corresponding value of x 1 is 4. } In the minimization problems, the reduced cost of a nonbasic variable can also be read from the allowable decrease value of that variable at obj. coefficient ranges.
32 Utilizing Lindo Output } The same Lindo output reveals the shadow prices of the constraints in the "dual price" section. } The shadow price of the first constraint (Row 2) equals 10. } The shadow price of the second constraint (Row 3) equals 1.
33 Some Important Equations } If the change in the RHS of the constraint leaves the current basis optimal (within the allowable RHS range), the following equations can be used to calculate new objective function value: } for maximization problems new obj. fn. value = old obj. fn. value + (new RHS old RHS) shadow price } for minimization problems new obj. fn. value = old obj. fn. value (new RHS old RHS) shadow price
34 Some Important Equations } For Lindo example, as the allowable increases in RHS ranges are infinity for each constraint, we can increase RHS of them as much as we want. But according to allowable decreases, RHS of the first constraint can be decreased by 100 and that of second constraint by 1. } Lets assume that new RHS value of the first constraint is 60. As the change is within allowable range, we can use the first equation (max. problem): z new = ( ) 10 = 601
35 Sensitivity Anlysis using Lindo Example!Dakota Furniture!x1, x2, x3 production amounts of desk, table, chair. Weekly profit: $z Max 60x1+ 30x2 + 20x3 st LUMBER) 8x1 + 6x2 + x3 <= 48 FINISH) 4x1 + 2x x3 <= 20 CARPNT) 2x x x3 <= 8 DEMAND) x2 <= 5 END 37
36 LP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE 1) VARIABLE VALUE REDUCED COST X X X ROW SLACK OR SURPLUS DUAL PRICES LUMBER) FINISH) CARPNT) DEMAND) NO. ITERATIONS= 2 RANGES IN WHICH THE BASIS IS UNCHANGED: 38 OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X X INFINITY X RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE LUMBER INFINITY FINISH CARPNT DEMAND INFINITY
37 Examples } What will be maximum total profit (Z) if the unit profit of the desk (x1) increases to 70? } What will be maximum total profit (Z) if the unit profit of the table (x2) decreases to 25? } What will be maximum total profit (Z) if the unit profit of the chair (x3) decreases to 10? } What will be maximum total profit (Z) if available lumber is equal to 30? } What will be maximum total profit (Z) if available finishing hours is equal to 22? } What will be maximum total profit (Z) if available carpentary hours s equal to 6? 39
38 Tomorrow } Topics: } Software to solve LPs and other mathematical programs. } Lindo } Excel Solver } QM for windows } Download them from the link: } } Bring your laptops!
Linear Programming Notes VII Sensitivity Analysis
Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization
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 6: Sensitivity Analysis
Chapter 6: Sensitivity Analysis Suppose that you have just completed a linear programming solution which will have a major impact on your company, such as determining how much to increase the overall production
More information56:171 Operations Research Midterm Exam Solutions Fall 2001
56:171 Operations Research Midterm Exam Solutions Fall 2001 True/False: Indicate by "+" or "o" whether each statement is "true" or "false", respectively: o_ 1. If a primal LP constraint is slack at the
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 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 information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationSimplex method summary
Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for
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 information3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max
SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More informationChapter 2 Solving Linear Programs
Chapter 2 Solving Linear Programs Companion slides of Applied Mathematical Programming by Bradley, Hax, and Magnanti (Addison-Wesley, 1977) prepared by José Fernando Oliveira Maria Antónia Carravilla A
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationQuestion 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 informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
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 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 informationUsing the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood
PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8720-E October 1998 $3.00 Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood A key problem faced
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationChapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints
Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and
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 informationStandard Form of a Linear Programming Problem
494 CHAPTER 9 LINEAR PROGRAMMING 9. THE SIMPLEX METHOD: MAXIMIZATION For linear programming problems involving two variables, the graphical solution method introduced in Section 9. is convenient. However,
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 informationSolving Linear Programs
Solving Linear Programs 2 In this chapter, we present a systematic procedure for solving linear programs. This procedure, called the simplex method, proceeds by moving from one feasible solution to another,
More informationLinear Programming. April 12, 2005
Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first
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 information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More information15.053/8 February 26, 2013
15.053/8 February 26, 2013 Sensitivity analysis and shadow prices special thanks to Ella, Cathy, McGraph, Nooz, Stan and Tom 1 Quotes of the Day If the facts don't fit the theory, change the facts. --
More information3 Introduction to Linear Programming
3 Introduction to Linear Programming 24 The development of linear programming has been ranked among the most important scientific advances of the mid-20th century, and we must agree with this assessment.
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationLinear Programming: Theory and Applications
Linear Programming: Theory and Applications Catherine Lewis May 11, 2008 1 Contents 1 Introduction to Linear Programming 3 1.1 What is a linear program?...................... 3 1.2 Assumptions.............................
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More informationUsing EXCEL Solver October, 2000
Using EXCEL Solver October, 2000 2 The Solver option in EXCEL may be used to solve linear and nonlinear optimization problems. Integer restrictions may be placed on the decision variables. Solver may be
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 informationLINEAR PROGRAMMING WITH THE EXCEL SOLVER
cha06369_supa.qxd 2/28/03 10:18 AM Page 702 702 S U P P L E M E N T A LINEAR PROGRAMMING WITH THE EXCEL SOLVER Linear programming (or simply LP) refers to several related mathematical techniques that are
More informationOperation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1
Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear
More informationLinear Programming II: Minimization 2006 Samuel L. Baker Assignment 11 is on page 16.
LINEAR PROGRAMMING II 1 Linear Programming II: Minimization 2006 Samuel L. Baker Assignment 11 is on page 16. Introduction A minimization problem minimizes the value of the objective function rather than
More informationQuestion 2: How will changes in the objective function s coefficients change the optimal solution?
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
More informationLECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method
LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right
More informationLecture 2: August 29. Linear Programming (part I)
10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationLinear programming. Learning objectives. Theory in action
2 Linear programming Learning objectives After finishing this chapter, you should be able to: formulate a linear programming model for a given problem; solve a linear programming model with two decision
More informationSolving Linear Programs in Excel
Notes for AGEC 622 Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University Thanks to Michael Lau for his efforts to prepare the earlier copies of this. 1 http://ageco.tamu.edu/faculty/mccarl/622class/
More informationLinear Programming Sensitivity Analysis
Linear Programming Sensitivity Analysis Massachusetts Institute of Technology LP Sensitivity Analysis Slide 1 of 22 Sensitivity Analysis Rationale Shadow Prices Definition Use Sign Range of Validity Opportunity
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationSolving Linear Programs using Microsoft EXCEL Solver
Solving Linear Programs using Microsoft EXCEL Solver By Andrew J. Mason, University of Auckland To illustrate how we can use Microsoft EXCEL to solve linear programming problems, consider the following
More information0.1 Linear Programming
0.1 Linear Programming 0.1.1 Objectives By the end of this unit you will be able to: formulate simple linear programming problems in terms of an objective function to be maximized or minimized subject
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationCPLEX Tutorial Handout
CPLEX Tutorial Handout What Is ILOG CPLEX? ILOG CPLEX is a tool for solving linear optimization problems, commonly referred to as Linear Programming (LP) problems, of the form: Maximize (or Minimize) c
More informationChapter 4. Duality. 4.1 A Graphical Example
Chapter 4 Duality Given any linear program, there is another related linear program called the dual. In this chapter, we will develop an understanding of the dual linear program. This understanding translates
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationLinear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
More informationChapter 2: Introduction to Linear Programming
Chapter 2: Introduction to Linear Programming You may recall unconstrained optimization from your high school years: the idea is to find the highest point (or perhaps the lowest point) on an objective
More informationChapter 3: Section 3-3 Solutions of Linear Programming Problems
Chapter 3: Section 3-3 Solutions of Linear Programming Problems D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 3: Section 3-3 Solutions of Linear Programming
More informationStudy Guide 2 Solutions MATH 111
Study Guide 2 Solutions MATH 111 Having read through the sample test, I wanted to warn everyone, that I might consider asking questions involving inequalities, the absolute value function (as in the suggested
More informationModeling and solving linear programming with R. Jose M Sallan Oriol Lordan Vicenc Fernandez
Modeling and solving linear programming with R Jose M Sallan Oriol Lordan Vicenc Fernandez Open Access Support If you find this book interesting, we would appreciate that you supported its authors and
More informationEXCEL SOLVER TUTORIAL
ENGR62/MS&E111 Autumn 2003 2004 Prof. Ben Van Roy October 1, 2003 EXCEL SOLVER TUTORIAL This tutorial will introduce you to some essential features of Excel and its plug-in, Solver, that we will be using
More informationChapter 13: Binary and Mixed-Integer Programming
Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:
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 informationUsing CPLEX. =5 has objective value 150.
Using CPLEX CPLEX is optimization software developed and sold by ILOG, Inc. It can be used to solve a variety of different optimization problems in a variety of computing environments. Here we will discuss
More informationCONTENTS. CASE STUDY W-3 Cost Minimization Model for Warehouse Distribution Systems and Supply Chain Management 22
CONTENTS CHAPTER W Linear Programming 1 W-1 Meaning, Assumptions, and Applications of Linear Programming 2 The Meaning and Assumptions of Linear Programming 2 Applications of Linear Programming 3 W-2 Some
More information9.4 THE SIMPLEX METHOD: MINIMIZATION
SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 59 The accounting firm in Exercise raises its charge for an audit to $5 What number of audits and tax returns will bring in a maximum revenue? In the simplex
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationNetwork Models 8.1 THE GENERAL NETWORK-FLOW PROBLEM
Network Models 8 There are several kinds of linear-programming models that exhibit a special structure that can be exploited in the construction of efficient algorithms for their solution. The motivation
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 informationinformation available. There is a tremendous amount of sensitivity information, or information
Chapter 8 Sensitivity Analysis for Linear Programming Finding the optimal solution to a linear programming model is important, but it is not the only information available. There is a tremendous amount
More information5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of Equations-Graphically and Algebraically Solving Systems - Substitution Method Solving Systems - Elimination Method Using -Dimensional Graphs to Approximate
More informationOffered to MAN ECN IRL THM IBT Elective. Course Level Course Code Year Semester ECTS Weekly Course Hours
Offered by Department of Business Administration Course Status Offered to MAN ECN IRL THM IBT Compulsory Offered to MAN ECN IRL THM IBT Elective Course Title Management Science Course Level Course Code
More informationSolutions Of Some Non-Linear Programming Problems BIJAN KUMAR PATEL. Master of Science in Mathematics. Prof. ANIL KUMAR
Solutions Of Some Non-Linear Programming Problems A PROJECT REPORT submitted by BIJAN KUMAR PATEL for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationSENSITIVITY ANALYSIS AS A MANAGERIAL DECISION
SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL SUMMARY Martina Briš, B.Sc.(Econ) Faculty of Economics in Osijek 87 Decision making is
More informationLinear Programming Problems
Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number
More informationLinear Programming. Before studying this supplement you should know or, if necessary, review
S U P P L E M E N T Linear Programming B Before studying this supplement you should know or, if necessary, review 1. Competitive priorities, Chapter 2 2. Capacity management concepts, Chapter 9 3. Aggregate
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one
More informationIn this section, we will consider techniques for solving problems of this type.
Constrained optimisation roblems in economics typically involve maximising some quantity, such as utility or profit, subject to a constraint for example income. We shall therefore need techniques for solving
More informationEleonóra STETTNER, Kaposvár Using Microsoft Excel to solve and illustrate mathematical problems
Eleonóra STETTNER, Kaposvár Using Microsoft Excel to solve and illustrate mathematical problems Abstract At the University of Kaposvár in BSc and BA education we introduced a new course for the first year
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationLU Factorization Method to Solve Linear Programming Problem
Website: wwwijetaecom (ISSN 2250-2459 ISO 9001:2008 Certified Journal Volume 4 Issue 4 April 2014) LU Factorization Method to Solve Linear Programming Problem S M Chinchole 1 A P Bhadane 2 12 Assistant
More informationReduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
More informationReview of Production and Cost Concepts
Sloan School of Management 15.010/15.011 Massachusetts Institute of Technology RECITATION NOTES #3 Review of Production and Cost Concepts Thursday - September 23, 2004 OUTLINE OF TODAY S RECITATION 1.
More information4.2 Description of the Event operation Network (EON)
Integrated support system for planning and scheduling... 2003/4/24 page 39 #65 Chapter 4 The EON model 4. Overview The present thesis is focused in the development of a generic scheduling framework applicable
More information4 UNIT FOUR: Transportation and Assignment problems
4 UNIT FOUR: Transportation and Assignment problems 4.1 Objectives By the end of this unit you will be able to: formulate special linear programming problems using the transportation model. define a balanced
More informationLinear Program Solver
Linear Program Solver Help Manual prepared for Forest Management course by Bogdan Strimbu 1 Introduction The Linear Program Solver (LiPS) Help manual was developed to help students enrolled in the senior
More information26 Linear Programming
The greatest flood has the soonest ebb; the sorest tempest the most sudden calm; the hottest love the coldest end; and from the deepest desire oftentimes ensues the deadliest hate. Th extremes of glory
More informationNonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,
More informationLECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005
LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005 DAVID L. BERNICK dbernick@soe.ucsc.edu 1. Overview Typical Linear Programming problems Standard form and converting
More informationSpreadsheets have become the principal software application for teaching decision models in most business
Vol. 8, No. 2, January 2008, pp. 89 95 issn 1532-0545 08 0802 0089 informs I N F O R M S Transactions on Education Teaching Note Some Practical Issues with Excel Solver: Lessons for Students and Instructors
More informationUsing Excel s Solver
Using Excel s Solver Contents Page Answer Complex What-If Questions Using Microsoft Excel Solver........... 1 When to Use Solver Identifying Key Cells in Your Worksheet Solver Settings are Persistent Saving
More informationIntroduction to Linear Programming (LP) Mathematical Programming (MP) Concept
Introduction to Linear Programming (LP) Mathematical Programming Concept LP Concept Standard Form Assumptions Consequences of Assumptions Solution Approach Solution Methods Typical Formulations Massachusetts
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three
More informationInteger Programming. subject to: (i = 1, 2,..., m),
Integer Programming 9 The linear-programming models that have been discussed thus far all have been continuous, in the sense that decision variables are allowed to be fractional. Often this is a realistic
More informationGENERALIZED INTEGER PROGRAMMING
Professor S. S. CHADHA, PhD University of Wisconsin, Eau Claire, USA E-mail: schadha@uwec.edu Professor Veena CHADHA University of Wisconsin, Eau Claire, USA E-mail: chadhav@uwec.edu GENERALIZED INTEGER
More informationINTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models
Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationUSING EXCEL 2010 TO SOLVE LINEAR PROGRAMMING PROBLEMS MTH 125 Chapter 4
ONE-TIME ONLY SET UP INSTRUCTIONS Begin by verifying that the computer you are using has the Solver Add-In enabled. Click on Data in the menu across the top of the window. On the far right side, you should
More informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More information