MS-E2140. Lecture 1. (course book chapters )
|
|
- Silvia Allen
- 5 years ago
- Views:
Transcription
1 Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters ) Linear programming problems and examples Problem manipulations and standard form Graphical representation of linear programming problems Modeling absolute values Modeling piecewise linear convex functions v. 1.1
2 Motivations Linear Programming (LP) problems form an important class of optimization problems with many practical applications. Linear Programming has applications for example in Production planning, resource allocation, investment decisions, military operations, scheduling, transportation and logistics, inventory management, scheduling, game theory... Efficient LP solution methods have been developed, and nowadays routinely used within optimization packages to solve even very large problems The Simplex algorithm for solving Linear Programs (Dantzig, 1947) is considered one of the top 10 algorithms developed in the 20-th century ( LP theory and duality form the basis to the development of more sophisticated methods for solving hard combinatorial optimization problems
3 Hystorical background The rapid and systematic development of Linear Programming as a practical tool for modeling and solving optimization problems started with the invention of the Simplex algorithm in 1947 The Simplex algorithm was invented by Dantzig to solve military planning problems, and is one of the most practically effective methods for solving LPs (earlier methods are due to Fourier, 1824, and de la Vallee Poussin, 1910) Linear Programming models were also studied in economics in the late 30s by Leonid Kantorovich. Tjalling Koopmans (nobel prize in 1975 with Kantorovich) and Wassily Leontief (nobel prize in 1973) also played important roles The work of von Neumann in game theory (1928) and duality also proved to have strong connections with the fundamental theory of linear programming Paper: Dantzig, G. (2002). Linear Programming, reprinted in Operations Research, Vol. 50, No.1, pp ,
4 Linear programming problems Minimize or maximize a linear objective function subject to a set of m linear constraints Cost coefficient Minimize z = c 1 x 1 + c 2 x c n x n subject to Objective function Can be, or = a 11 x 1 + a 12 x a 1n x n b 1 a 21 x 1 + a 22 x a 2n x n b Constraints a m1 x 1 + a m2 x a mn x n = b m x 1, x 2, x n 0 Decision variables Non-negativity constraints In general, not all variables may be required to be 0, or some may be required to be 0
5 A Linear Programming problem (LP) can be expressed in matrix form Minimize z = c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n b a m1 x 1 + a m2 x a mn x n b m x 1, x 2, x n 0 Minimize z = c x subject to Ax b x 0 Notation: c = c 1, c 2,, c n R n x = (x 1, x 2,, x n ) R n b = (b 1, b 2,, b m ) R m A = a 11 a 1n R m n a m1 a mn Constraint matrix We will write a i to denote the i-th row of A so that the i-th constraint can be written as a i x b i a 1 Note: The symbol denotes transposition
6 Terminology. For an LP with a minimization objective function: A vector x that satisfies all the constraints is called feasible solution The set of all the feasible solutions is called feasible region A feasible solution x that minimizes the objective function (i.e., such that c x c x for any feasible solution x) is called optimal solution The value c x is called optimal cost x 2 (2) Minimize x 1 3x 2 s.t. x 1 x 2 6 constraint (1) (3) Feasible region (1) x 1 2x 2 8 x 1 + x 2 2 constraint (2) constraint (3) x 1 x 1, x 2 0
7 Examples of LPs Product blending. A manufacturer of plastics is planning to blend a new product by mixing four chemical compounds. Each compound contains three chemicals A, B, and C in different percentages. The composition and unit cost of the each compounds is: Each column gives the composition and cost of one compound Comp. 1 Comp. 2 Comp. 3 Comp. 4 % of A % of B % of C Cost/Kg The new product must contain 25% of element A, at least 35% of element B, and at least 20% of element C Moreover, to avoid side effects compounds 1 and 2 cannot exceed 25% and 30% of the total, respectively
8 What is the cheapest way of blending the new product? Decision variables x i : fraction of compound i (i = 1,, 4) used to produce one unit of the new product Mathematical formulation minimize z = 20x x x x 4 s.t. x 1 + x 2 + x 3 + x 4 = 1 30x x x x 4 = 25 20x x x x x x x x 4 20 x , x x 1, x 2, x 3, x 4 0 Cost to produce one unit of the new product % of element A % of element B % of element C Maximum % of comp. 1, 2 Non-negativity
9 The problem in matrix form is: x 1 Minimize z = c x s.t. A 1 x = b x 2 x 3 = 1 25 A 2 x b 2 A 3 x b 3 A 1 x 4 x x 1 b 1 x 0 where A 1 = b 1 = A 2 x 2 x 3 x 4 x b 2 A 2 = b 2 = x 1 x 2 x A 3 = b 3 = A 3 x 4 x b 3 c =
10 Production planning. A food firm is planning the production for the next 4 months, and can use a warehouse to stock food in each month. The maximum storage capacity of the warehouse is 100 tons, and each ton of stock at the end of any month has a cost of 5 EUR On month i, there is a production cost c i for each ton and a maximum production of p i tons is possible An extra production of q i tons is possible at extra cost: Each ton produced in excess of p i in month i has an additional cost of e i The firm has contracted to provide d i tons on each month i The warehouse is empty at the beginning of the first month, and must be empty at the end of the last month Finally, the regular production in each month must be at last 10% of the total production of the first three months (balanced production)
11 Row i gives the monthly production costs, demand, and capacities of month i Month (i) Production cost (c i ) Demand (d i ) Max. production (p i ) Max. extra production (q i ) Extra production cost (e i ) Objective: Minimize the costs over the four months Decision variables. x i : Regular production on month i = 1,, 4 s i : Extra production on month i = 1,, 4 y i : Warehouse stock at the end of month i = 1,, 3 Note: y 4 must always be 0, we don t need it explicitly in the model (the warehouse must be empty at the end of the last month)
12 Mathematical formulation 4 minimize z = (10x i + 16s i + 5y i ) Total production cost i=1 s.t. x 1 + s 1 = y 1 x 2 + s 2 + y 1 = y 2 x 3 + s 3 + y 2 = y 3 The total production in month i must equal the demand of that month plus the stock at the end of the month x 4 + s 4 + y 3 = 200 x i (s 1 + x 1 + s 2 + x 2 + s 3 + x 3 ) 0.1, i = 1,, 4 Balanced production x 1 140, x 2 150, x 3 140, x s 1 50, s 2 75, s 3 70, s 4 80 x i 0, s i 0, i = 1,, 4, y i 0, i = 1,, 3 Maximum regular and extra production Non-negativity
13 Problem manipulations LPs can be equivalently expressed in different forms: Minimize c x is equivalent to Maximize c x An equality constraint a 11 x a 1n x n = b 1 can be equivalently replaced by the two inequalities: a 11 x a 1n x n b 1 and a 11 x a 1n x n b 1 An inequality constraint a 11 x a 1n x n b 1 can be replaced by the equivalent inequality (a 11 x a 1n x n ) b 1 An inequality constraint a 11 x a 1n x n b 1 is equivalent to a 11 x a 1n x n + s 1 = b 1, where s 1 0 is a new variable called slack variable Similarly, a 11 x a 1n x n b 1 becomes a 11 x a 1n x n s 1 = b 1, where s 1 0
14 Any free variable x i (i.e., not restricted to be 0 or 0) can be replaced by the expression (x + i x i ) where x + i 0 and x i 0 Examples minimize z = 2x 1 + 5x 2 s. t 3x 1 + 2x 2 6 2x 1 + 9x 2 8 x 1 0 free Equivalent minimize z = 2x 1 + 5(x + 2 x 2 ) s. t 3x 1 + 2(x + 2 x 2 ) 6 2x 1 + 9(x + 2 x 2 ) 8 x 1, x + 2, x 2 0 minimize z = 2x 1 x 2 + 4x 3 minimize z = 2x 1 x 2 + 4x 3 s. t x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0, x 3 0 Equivalent s. t x 1 x 2 x 4 2 3x 2 x 3 5 3x 2 + x 3 5 x 3 +x 4 3 x 1 0, x 3 0
15 Standard form problems By using the previous transformations we can always express any LP in the following form, called standard form All variables must be non-negative Minimize z = c x s.t. Ax = b, x 0 All constraints are equality constraints Starting from any LP, we can put it in standard form by: 1. Replacing each free variable x i with (x i + x i ) where x i + 0, x i 0 2. Transforming any inequality constraint into an equality constraint by adding slack variables Any LP and its standard form are equivalent: Given a feasible solution to the original LP we can construct a feasible solution to its standard form with same cost, and vice versa
16 Example minimize z = 2x 1 + 4x 2 s. t x 1 + x 2 3 3x 1 + 2x 2 = 14 x 1 0 Standard form minimize z = 2x 1 + 4x + 2 4x 2 s. t x 1 + x + 2 x 2 s 1 = 3 3x 1 + 2x + 2 2x 2 = 14 x 1, x + 2, x 2, s 1 0 The Simplex algorithm is designed to solve LPs in standard form This is because it is based on the following operations: 1. multiply the coefficients and right hand side of a constraint by a nonnull real number 2. apply operation 1 to a constraint and sum the result to another one
17 The operations 1 and 2 when applied to a system of linear equations leave unchanged the set of feasible solutions However, when applied to a system of inequalities they do change the set of solutions Example (a) (b) x 1 2x 2 0 x 2 0 Multiply (b) by 2 and add to (a) x 1 0 x 2 0 x 2 x 2 x 1 x 1
18 Graphical representation of an LP By transforming any equality constraint into an inequality, we can also always rewrite an LP in the following general form where eventual non-negativity constraints are also included in the definition of A minimize z = 3x 1 2x 2 + x 3 s.t. 2x 1 x 2 1 x 2 + x 3 5 x 1 0 x 3 0 Minimize z = c x s.t. Ax b A = x = (x 1 x 2 x 3 ) b = ( ) Each constraint of an LP in this form with n variables defines a region of R n, called halfspace, containing all x R n satisfying the constraint The feasible region is then the intersection of all these halfspaces
19 For LPs in general form with two or three variables we can visualize the feasible region, and even solve them graphically: minimize z = x 1 3x 2 x 1 x 2 6 (1) x 1 2x 2 8 (2) x 1 + x 2 2 (3) x x 2 0 (5) Halfspace defined by x 1 + x 2 2 x 2 Halfspace defined by x 1 + x 2 2 x 1 + x 2 = 2 x 1 The feasible region is the intersection of the halfspaces defined by (1) (5) x 2 For any value z, the set of all solutions x with (3) (5) (2) feasible region (1) (4) cost z forms a line c x = x 1 3x 2 = z (sometimes called isoprofit line) This line is perpendicular to the vector c = ( 1, 3) c x 1
20 x 2 Optimal solution x = ( ), z = 38/3 c x = z x 1 3x 2 = 38/3 (z = 38/3) x 1 3x 2 = 12 (z = 12) c = ( 1 3) x 1 3x 2 = 6 (z = 6) x 1 3x 2 = 0 (z = 0) Isoprofit line for z = 0 The value z decreases along the direction c so minimizing z corresponds to moving the line z = x 1 3x 2 in the direction of c The minimum value of z is obtained when the line cannot be moved further without leaving the feasible region When this happens the line intersects a corner point of the feasible region which is an optimal solution
21 It is not always the case that an LP has a unique optimal solution Consider the following LP: minimize z = c 1 x 1 + c 2 x 2 x 1 + x 2 1 x 1 0 x 2 0 Depending on the choice of c, the following cases can occur: x 1 x 1 + x 2 = 1 Feasible region x 2 Unique optimal solution Bounded set of alternative optimal solutions x 1 x is the only optimal solution x 1 Any solution x = (0 x 2 ) with 0 x 2 1 is optimal (0 1) c = (1 1) x = (0 x 2 ) with 0 x 2 1 x = (0 0) c x = x 1 + x 2 = 0 (z = 0) x 2 (0 0) c = (1 0) x 2
22 Unbounded set of alternative optimal solutions Any solution x = (x 1 0) with x 1 0 is optimal Unbounded optimal cost (unbounded problem) There is not an optimal solution: z for x 1, x 2 the optimal cost is c = (0 1) c x = x 1 x 2 = z x x = (x 1 0) with x 1 0 c = ( 1 1) z Finally, the feasible region can be empty, in which case there are not feasible solutions and the LP is infeasible: minimize z = c 1 x 1 + c 2 x 2 x 1 + x 2 1 x 1 x 2 2 x 1 0 x 2 0 x 1 x 2 2 x 1 + x 2 1
23 Modeling absolute values LPs can be used to model situations where variables represent absolute values under some assumptions on the sign of their coefficients. Consider the problem: minimize n i=1 c i x i s.t. Ax b where x = (x 1,, x n ) and c i 0, i = 1,, n We can note that x i is the smallest number y i satisfying y i x i and y i x i, so we can rewrite the problem as the LP minimize n i=1 c i y i s.t. Ax b y i x i, i = 1,, n y i x i, i = 1,, n This is correct because c i 0 and we are minimizing: An optimal solution must have y i = max x i, x i = x i ; Otherwise we could reduce y i and obtain a feasible solution with lower cost
24 Another possibility to rewrite the same problem as an LP is to: replace x i with (x i + x i ) where x i + 0, x i 0 replace x i with (x i + + x i ) In this way we obtain the LP: Example: for x i = 4 we can write x + i = 0 and x i = 4 so that x i = x + i x i and x i = x + i + x i minimize n i=1 c i x i + + x i s.t. Ax + Ax b x +, x 0 where x + = (x + 1,, x + n ) and x = (x 1,, x n ) Since we are minimizing and c i 0, an optimal solution must have x + i = 0 or x i = 0, i, because otherwise we could reduce both x + i and x i by the same amount and obtain a better feasible solution
25 Example. Consider the problem: Minimize z = 2 x 1 + x 2 s.t. x 1 + x 2 4 The two alternative reformulations to transform it into an LP are: Minimize z = 2y 1 + x 2 s.t. x 1 + x 2 4 y 1 x 1 y 1 x 1 Minimize z = 2x x 1 + x 2 s.t. x + 1 x 1 + x 2 4 x x 1 0
26 Modeling piecewise linear functions A function f: R n R is called convex if for every x, y R n, and for every λ [0,1], we have f λx + 1 λ y λf x + (1 λ)f y f is concave if it satisfies the above with " " replaced by " Note: All points λx + 1 λ y lie on the line segment joining x and y; Informally, f is convex if its graph lies below the line connecting x and y f x λf x + (1 λ)f y, for λ [0,1] f x f y f y x y x y A convex function f λx + (1 λ)y, for λ [0,1] A concave function
27 A function of the form f x = max (c i x + d i ) is called piecewise i=1,,m linear convex (or piecewise linear concave if max is replaced by min). Example with m = 3, and x R 1 f x = max 1 x, 2 x + 2, x + 5 is piecewise linear convex Piecewise linear convex (or concave) functions can be used to approximate convex (or concave) functions f x f x x x x + 2 A piecewise linear convex function x A convex function approximated by a piecewise linear convex function x
28 LPs can be used to model: the minimization of a piecewise linear convex function (1) Minimize z = max (c i x + d i ) i=1,,m s.t. Ax b the maximization of a piecewise linear concave function (2) Maximize z = min (c i x + d i ) i=1,,m s.t. Ax b The idea is to introduce z explicitly as a variable and impose z c i x + d i or z c i x + d i, i. Problems (1), (2) become the LP: (1) Minimize z (2) Maximize z s.t. Ax b z c i x + d i, i = 1,, m s.t. Ax b z c i x + d i, i = 1,, m
29 Example. Consider a firm producing and selling a product. A typical strategy is to introduce economies of scale to incentivate bulk buys Suppose the unit selling price is set to 10 EUR for the first 1000 units, but is reduced to 7 EUR for any amount in excess to that Suppose an LP is used in planning the production with variables x i representing the amount produced (and sold) in month i = 1,, n, subject to a set of constraints Ax b (with x = (x 1,, x n )) The profit p i that can be made from the sales in month i is: p i (x i ) = 10x i, if 0 x i 1, , (x i 1,000), if x i 1,000 which is equivalent to = x i p i x i = min 10x i, 10, x i 1,000 = min 10x i, 7x i
30 Example (cont.) The problem of maximizing the profit over the n months can then be modeled as the maximization of a piecewise linear concave function: which can be rewritten as the LP Maximize i=1,,n p i (x i ) s.t. Ax b Maximize i=1,,n p i s.t. Ax b p i 10x i, i = 1,, n p i 7x i , i = 1,, n
MS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
More informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
More informationUNIT-4 Chapter6 Linear Programming
UNIT-4 Chapter6 Linear Programming Linear Programming 6.1 Introduction Operations Research is a scientific approach to problem solving for executive management. It came into existence in England during
More informationIntroduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role
Linear Programming RK Jana Lecture Outline Introduction to Linear Programming (LP) Historical Perspective Model Formulation Graphical Solution Method Simplex Method Introduction to LP Continued Today many
More informationExam 3 Review Math 118 Sections 1 and 2
Exam 3 Review Math 118 Sections 1 and 2 This exam will cover sections 5.3-5.6, 6.1-6.3 and 7.1-7.3 of the textbook. No books, notes, calculators or other aids are allowed on this exam. There is no time
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1
More informationLINEAR PROGRAMMING. Relation to the Text (cont.) Relation to Material in Text. Relation to the Text. Relation to the Text (cont.
LINEAR PROGRAMMING Relation to Material in Text After a brief introduction to linear programming on p. 3, Cornuejols and Tϋtϋncϋ give a theoretical discussion including duality, and the simplex solution
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
More informationIE 400 Principles of Engineering Management. Graphical Solution of 2-variable LP Problems
IE 400 Principles of Engineering Management Graphical Solution of 2-variable LP Problems Graphical Solution of 2-variable LP Problems Ex 1.a) max x 1 + 3 x 2 s.t. x 1 + x 2 6 - x 1 + 2x 2 8 x 1, x 2 0,
More informationLINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.
3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.4 Sensitivity Analysis Copyright Cengage Learning. All rights reserved. Sensitivity Analysis In this section,
More informationLINEAR PROGRAMMING 2. In many business and policy making situations the following type of problem is encountered:
LINEAR PROGRAMMING 2 In many business and policy making situations the following type of problem is encountered: Maximise an objective subject to (in)equality constraints. Mathematical programming provides
More informationLinear Programming Duality
Summer 2011 Optimization I Lecture 8 1 Duality recap Linear Programming Duality We motivated the dual of a linear program by thinking about the best possible lower bound on the optimal value we can achieve
More informationLecture 1 Introduction
L. Vandenberghe EE236A (Fall 2013-14) Lecture 1 Introduction course overview linear optimization examples history approximate syllabus basic definitions linear optimization in vector and matrix notation
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 informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 5: The Simplex Algorithm Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School of
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationMath 407 Linear Optimization
Introduction. What is optimization? Math 407 Linear Optimization Broadly speaking, a mathematical optimization problem is one in which a given real value function is either maximized or minimized relative
More informationSection 4.1 Solving Systems of Linear Inequalities
Section 4.1 Solving Systems of Linear Inequalities Question 1 How do you graph a linear inequality? Question 2 How do you graph a system of linear inequalities? Question 1 How do you graph a linear inequality?
More informationUNIVERSITY OF KWA-ZULU NATAL
UNIVERSITY OF KWA-ZULU NATAL EXAMINATIONS: June 006 Solutions Subject, course and code: Mathematics 34 MATH34P Multiple Choice Answers. B. B 3. E 4. E 5. C 6. A 7. A 8. C 9. A 0. D. C. A 3. D 4. E 5. B
More informationII. Analysis of Linear Programming Solutions
Optimization Methods Draft of August 26, 2005 II. Analysis of Linear Programming Solutions Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston, Illinois
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationAlgorithms and Theory of Computation. Lecture 13: Linear Programming (2)
Algorithms and Theory of Computation Lecture 13: Linear Programming (2) Xiaohui Bei MAS 714 September 25, 2018 Nanyang Technological University MAS 714 September 25, 2018 1 / 15 LP Duality Primal problem
More informationIntroduction to linear programming using LEGO.
Introduction to linear programming using LEGO. 1 The manufacturing problem. A manufacturer produces two pieces of furniture, tables and chairs. The production of the furniture requires the use of two different
More informationChap6 Duality Theory and Sensitivity Analysis
Chap6 Duality Theory and Sensitivity Analysis The rationale of duality theory Max 4x 1 + x 2 + 5x 3 + 3x 4 S.T. x 1 x 2 x 3 + 3x 4 1 5x 1 + x 2 + 3x 3 + 8x 4 55 x 1 + 2x 2 + 3x 3 5x 4 3 x 1 ~x 4 0 If we
More informationMath 5593 Linear Programming Week 1
University of Colorado Denver, Fall 2013, Prof. Engau 1 Problem-Solving in Operations Research 2 Brief History of Linear Programming 3 Review of Basic Linear Algebra Linear Programming - The Story About
More informationMATH2070 Optimisation
MATH2070 Optimisation Linear Programming Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The standard Linear Programming (LP) Problem Graphical method of solving LP problem
More information3. Duality: What is duality? Why does it matter? Sensitivity through duality.
1 Overview of lecture (10/5/10) 1. Review Simplex Method 2. Sensitivity Analysis: How does solution change as parameters change? How much is the optimal solution effected by changing A, b, or c? How much
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions 1. What does the Representation Theorem say (in linear programming)? 2. What is the Fundamental Theorem of Linear Programming? 3. What is the main idea
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
More informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc. Mathematics (2011 Admission Onwards) II SEMESTER Complementary Course
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc. Mathematics (2011 Admission Onwards) II SEMESTER Complementary Course MATHEMATICAL ECONOMICS QUESTION BANK 1. Which of the following is a measure
More informationLectures 6, 7 and part of 8
Lectures 6, 7 and part of 8 Uriel Feige April 26, May 3, May 10, 2015 1 Linear programming duality 1.1 The diet problem revisited Recall the diet problem from Lecture 1. There are n foods, m nutrients,
More informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
More informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More informationAM 121: Intro to Optimization Models and Methods
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 2: Intro to LP, Linear algebra review. Yiling Chen SEAS Lecture 2: Lesson Plan What is an LP? Graphical and algebraic correspondence Problems
More informationTeaching Duality in Linear Programming - the Multiplier Approach
Teaching Duality in Linear Programming - the Multiplier Approach Jens Clausen DIKU, Department of Computer Science University of Copenhagen Universitetsparken 1 DK 2100 Copenhagen Ø June 3, 1998 Abstract
More informationOperations Research. Duality in linear programming.
Operations Research Duality in linear programming Duality in linear programming As we have seen in past lessons, linear programming are either maximization or minimization type, containing m conditions
More informationIntroduction to Operations Research. Linear Programming
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationChapter 2 Introduction to Optimization and Linear Programming
Ch. 2 Introduction to Optimization and Linear Programming TB-9 Chapter 2 Introduction to Optimization and Linear Programming Multiple Choice 1. What most motivates a business to be concerned with efficient
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
More informationGraphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna 2008 Prentice-Hall, Inc. Introduction Many management
More information1. Introduce slack variables for each inequaility to make them equations and rewrite the objective function in the form ax by cz... + P = 0.
3.4 Simplex Method If a linear programming problem has more than 2 variables, solving graphically is not the way to go. Instead, we ll use a more methodical, numeric process called the Simplex Method.
More informationIntroduction to Operations Research
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationOptimisation. 3/10/2010 Tibor Illés Optimisation
Optimisation Lectures 3 & 4: Linear Programming Problem Formulation Different forms of problems, elements of the simplex algorithm and sensitivity analysis Lecturer: Tibor Illés tibor.illes@strath.ac.uk
More informationSensitivity Analysis and Duality
Sensitivity Analysis and Duality Part II Duality Based on Chapter 6 Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan
More informationLINEAR PROGRAMMING II
LINEAR PROGRAMMING II LP duality strong duality theorem bonus proof of LP duality applications Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM LINEAR PROGRAMMING II LP duality Strong duality
More informationAlgorithmic Game Theory and Applications. Lecture 7: The LP Duality Theorem
Algorithmic Game Theory and Applications Lecture 7: The LP Duality Theorem Kousha Etessami recall LP s in Primal Form 1 Maximize c 1 x 1 + c 2 x 2 +... + c n x n a 1,1 x 1 + a 1,2 x 2 +... + a 1,n x n
More informationPart 1. The Review of Linear Programming Introduction
In the name of God Part 1. The Review of Linear Programming 1.1. Spring 2010 Instructor: Dr. Masoud Yaghini Outline The Linear Programming Problem Geometric Solution References The Linear Programming Problem
More informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationPrelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.
Prelude to the Simplex Algorithm The Algebraic Approach The search for extreme point solutions. 1 Linear Programming-1 x 2 12 8 (4,8) Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2
More informationDiscrete Optimization
Prof. Friedrich Eisenbrand Martin Niemeier Due Date: March, 200 Discussions: February 25, March 04 Discrete Optimization Spring 200 s You can hand in written solutions for up to two of the exercises marked
More informationUnderstanding the Simplex algorithm. Standard Optimization Problems.
Understanding the Simplex algorithm. Ma 162 Spring 2011 Ma 162 Spring 2011 February 28, 2011 Standard Optimization Problems. A standard maximization problem can be conveniently described in matrix form
More information56:270 Final Exam - May
@ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the
More informationChapter 4 The Simplex Algorithm Part I
Chapter 4 The Simplex Algorithm Part I Based on Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Lewis Ntaimo 1 Modeling
More informationSimplex tableau CE 377K. April 2, 2015
CE 377K April 2, 2015 Review Reduced costs Basic and nonbasic variables OUTLINE Review by example: simplex method demonstration Outline Example You own a small firm producing construction materials for
More informationSolutions to Review Questions, Exam 1
Solutions to Review Questions, Exam. What are the four possible outcomes when solving a linear program? Hint: The first is that there is a unique solution to the LP. SOLUTION: No solution - The feasible
More informationPlanning and Optimization
Planning and Optimization C23. Linear & Integer Programming Malte Helmert and Gabriele Röger Universität Basel December 1, 2016 Examples Linear Program: Example Maximization Problem Example maximize 2x
More informationToday: Linear Programming
Today: Linear Programming COSC 581, Algorithms March 27, 2014 Many of these slides are adapted from several online sources Today s class: Chapter 29.1 Reading Assignments Reading assignment for next Thursday
More informationCSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017
CSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017 Linear Function f: R n R is linear if it can be written as f x = a T x for some a R n Example: f x 1, x 2 =
More informationMA 162: Finite Mathematics - Section 3.3/4.1
MA 162: Finite Mathematics - Section 3.3/4.1 Fall 2014 Ray Kremer University of Kentucky October 6, 2014 Announcements: Homework 3.3 due Tuesday at 6pm. Homework 4.1 due Friday at 6pm. Exam scores were
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis
MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis Ann-Brith Strömberg 2017 03 29 Lecture 4 Linear and integer optimization with
More informationLinear programs, convex polyhedra, extreme points
MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg 2015 03 27 Linear programs, convex polyhedra, extreme points A linear
More informationAdvanced Linear Programming: The Exercises
Advanced Linear Programming: The Exercises The answers are sometimes not written out completely. 1.5 a) min c T x + d T y Ax + By b y = x (1) First reformulation, using z smallest number satisfying x z
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More informationNATIONAL OPEN UNIVERSITY OF NIGERIA SCHOOL OF SCIENCE AND TECHNOLOGY COURSE CODE: MTH 309 COURSE TITLE: OPTIMIZATION THEORY
NATIONAL OPEN UNIVERSITY OF NIGERIA SCHOOL OF SCIENCE AND TECHNOLOGY COURSE CODE: MTH 39 COURSE TITLE: OPTIMIZATION THEORY MTH 39 OPTIMIZATION THEORY Prof. U. A. Osisiogu August 28, 22 CONTENTS I 7 Linear
More informationLinear Programming. Linear Programming I. Lecture 1. Linear Programming. Linear Programming
Linear Programming Linear Programming Lecture Linear programming. Optimize a linear function subject to linear inequalities. (P) max " c j x j n j= n s. t. " a ij x j = b i # i # m j= x j 0 # j # n (P)
More informationMATH 445/545 Test 1 Spring 2016
MATH 445/545 Test Spring 06 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 545 level. Please read and follow all of these
More informationAM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1
AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1 Prof. Yiling Chen Fall 2018 Here are some practice questions to help to prepare for the midterm. The midterm will
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I
LN/MATH2901/CKC/MS/2008-09 THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operations Research I Definition (Linear Programming) A linear programming (LP) problem is characterized by linear functions
More informationCSC Design and Analysis of Algorithms. LP Shader Electronics Example
CSC 80- Design and Analysis of Algorithms Lecture (LP) LP Shader Electronics Example The Shader Electronics Company produces two products:.eclipse, a portable touchscreen digital player; it takes hours
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More informationChapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek
Chapter 3 Introduction to Linear Programming PART 1 Assoc. Prof. Dr. Arslan M. Örnek http://homes.ieu.edu.tr/~aornek/ise203%20optimization%20i.htm 1 3.1 What Is a Linear Programming Problem? Linear Programming
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 8 Linear programming: interior point method Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 31 Outline Brief
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
More informationDistributed Real-Time Control Systems. Lecture Distributed Control Linear Programming
Distributed Real-Time Control Systems Lecture 13-14 Distributed Control Linear Programming 1 Linear Programs Optimize a linear function subject to a set of linear (affine) constraints. Many problems can
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION
MATHEMATICAL ECONOMICS COMPLEMENTARY COURSE B.Sc. Mathematics II SEMESTER UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION Calicut University P. O. Malappuram, Kerala, India 67 65 40 UNIVERSITY OF CALICUT
More informationSolution Cases: 1. Unique Optimal Solution Reddy Mikks Example Diet Problem
Solution Cases: 1. Unique Optimal Solution 2. Alternative Optimal Solutions 3. Infeasible solution Case 4. Unbounded Solution Case 5. Degenerate Optimal Solution Case 1. Unique Optimal Solution Reddy Mikks
More informationLinear Functions, Equations, and Inequalities
CHAPTER Linear Functions, Equations, and Inequalities Inventory is the list of items that businesses stock in stores and warehouses to supply customers. Businesses in the United States keep about.5 trillion
More informationAnother max flow application: baseball
CS124 Lecture 16 Spring 2018 Another max flow application: baseball Suppose there are n baseball teams, and team 1 is our favorite. It is the middle of baseball season, and some games have been played
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationReview for Final Review
Topics Review for Final Review 1. Functions and equations and graphing: linear, absolute value, quadratic, polynomials, rational (first 1/3 of semester) 2. Simple Interest, compounded interest, and continuously
More informationDOWNLOAD PDF LINEAR OPTIMIZATION AND APPROXIMATION
Chapter 1 : COBYLA - Constrained Optimization BY Linear Approximation â pyopt A linear optimization problem is the task of minimizing a linear real-valued function of finitely many variables subject to
More informationECE 307- Techniques for Engineering Decisions
ECE 307- Techniques for Engineering Decisions Lecture 4. Dualit Concepts in Linear Programming George Gross Department of Electrical and Computer Engineering Universit of Illinois at Urbana-Champaign DUALITY
More informationAn introductory example
CS1 Lecture 9 An introductory example Suppose that a company that produces three products wishes to decide the level of production of each so as to maximize profits. Let x 1 be the amount of Product 1
More informationIntroduction. Formulating LP Problems LEARNING OBJECTIVES. Requirements of a Linear Programming Problem. LP Properties and Assumptions
Valua%on and pricing (November 5, 2013) LEARNING OBJETIVES Lecture 10 Linear Programming (part 1) Olivier J. de Jong, LL.M., MM., MBA, FD, FFA, AA www.olivierdejong.com 1. Understand the basic assumptions
More informationThe Transportation Problem
CHAPTER 12 The Transportation Problem Basic Concepts 1. Transportation Problem: BASIC CONCEPTS AND FORMULA This type of problem deals with optimization of transportation cost in a distribution scenario
More information36106 Managerial Decision Modeling Linear Decision Models: Part II
1 36106 Managerial Decision Modeling Linear Decision Models: Part II Kipp Martin University of Chicago Booth School of Business January 20, 2014 Reading and Excel Files Reading (Powell and Baker): Sections
More informationAvailable online Journal of Scientific and Engineering Research, 2015, 2(3): Research Article
Available online www.jsaer.com, 2015, 2(3):13-21 Research Article ISSN: 2394-2630 CODEN(USA): JSERBR The Optimization of Production Cost using Linear Programming Solver Ezeliora Chukwuemeka Daniel 1*,
More informationModern Logistics & Supply Chain Management
Modern Logistics & Supply Chain Management As gold which he cannot spend will make no man rich, so knowledge which he cannot apply will make no man wise. Samuel Johnson: The Idler No. 84 Production Mix
More informationOPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano
OPTIMIZATION joint course with Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-15-16.shtml
More informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
More informationOptimization. Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization. General form:
Optimization Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization General form: Min or Max f(x) (1) Subject to g(x) ~ b (2) lo < x < up (3) Some important
More informationPractice Questions for Math 131 Exam # 1
Practice Questions for Math 131 Exam # 1 1) A company produces a product for which the variable cost per unit is $3.50 and fixed cost 1) is $20,000 per year. Next year, the company wants the total cost
More information...(iii), x 2 Example 7: Geetha Perfume Company produces both perfumes and body spray from two flower extracts F 1. The following data is provided:
The LP formulation is Linear Programming: Graphical Method Maximize, Z = 2x + 7x 2 Subject to constraints, 2x + x 2 200...(i) x 75...(ii) x 2 00...(iii) where x, x 2 ³ 0 Example 7: Geetha Perfume Company
More information