(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6
|
|
- Marvin Stafford
- 5 years ago
- Views:
Transcription
1 The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider the following linear programming problem P. (P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6 x 1, x 2, x 3 0. (a) Solve P by using the dual Simplex method. Show the tableau at each iteration and indicate the pivot elements. Report both the primal and dual optimal solutions x and p associated with the optimal basis. (4pt) (b) Write the dual D of P. Use duality to verify that x and p are optimal. (3pt) Problem 2 Are the following statements true or false? Justify your answers. (5pt) (a) Consider a minimization linear programming problem P in standard form and let B be a basis matrix. If both the primal and dual basic solutions corresponding to B are feasible, then they are both optimal. (b) In solving an LP by the Simplex Method, a different basic feasible solution is generated after each pivoting operation. (c) The dual of a standard form minimization linear programming problem P can be either unbounded or infeasible if P has optimal cost. Problem 3 Consider the LP (P ) Minimize 2x 1 + x 2 s.t. 2x 1 + x 2 4x 3 2 x 1 x 2 + 2x 3 0 x 1 2 x 1, x 2, x 3 0. Page 1 / 6
2 The following is an optimal tableau for P where x 4, x 5, x 6 are slack variables. z x 1 x 2 x 3 x 4 x 5 x /2 0 1/ /2 0 1/4 1-1/4 0 1/2 Let x be the basic optimal solution associated with this tableau. Answer the following questions by using the optimal tableau above. Each of the questions is independent from the others. (8pt) (a) What is the optimal basis? What is the corresponding optimal solution to the dual of P? Explain why this solution can be obtained from the tableau. (b) Is x the unique optimal solution? Why? If it is not unique, find another optimal solution. (c) Suppose that the cost of variable x 3 is changed to 0 + δ. Find the range of values of δ for which the current basis remains optimal? Explain your work. How could you find a new optimal basis without resolving from scratch if δ is outside this range? (you don t have to actually find it) (d) Suppose that the cost of variable x 2 is changed to 1. After the change: Explain why the optimal cost becomes. Explain how to construct a feasible solution with cost M for any M > 0. Problem 4 Consider the uncapacitated minimum cost flow problem defined by the graph below. The number on each arc indicates its cost, and node supplies are indicated by the arrows. (a) Execute one iteration of the Network Simplex algorithm starting from the tree solution defined by arcs T = {(1, 4), (4, 2), (2, 5), (4, 3), (3, 6), (6, 7)}: (i) indicate the set T and the corresponding tree solution before and after the iteration, (iii) report the dual variables before and after the iteration, (iv) explain how the leaving and entering variables are selected and how the flows are updated. (4pt) (b) Is the dual solution that you obtained at the end of point (a) degenerate? Is it optimal? Justify the answers. (1pt) Page 2 / 6
3 Solutions Problem 1 (a) The problem in standard form is: min 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 + x 4 = 3 3x 2 2x 3 + x 5 = 6 x 1, x 2, x 3, x 4, x 5 0. A basis matrix B is formed by the columns corresponding to the slack variables x 4, x 5. The corresponding reduced cost vector is c = c c B B 1 A = c = [ ] as c B = [ c 4 c 5 ] = [ 0 0 ]. Since c 0, B can be used to start the dual Simplex. The corresponding (primal) basic solution is x 4 = 3, x 5 = 6, x 1 = x 2 = x 3 = 0 with cost 0. The dual Simplex tableaux are the following (pivot elements are marked by an ): x 1 x 2 x 3 x 4 x x x x 1 x 2 x 3 x 4 x 5 5 2/ /3 0 x 3 1 2/ /3 0 x 5 4 4/ /3 1 x 1 x 2 x 3 x 4 x / /3 2 x 3 1 2/ /3 0 x 2 4/3 4/ /9 1/3 The optimal primal solution is x = (0, 4/3, 1, 0, 0) of cost 13. The corresponding optimal dual solution p = (p 1, p 2 ) can be obtained directly from the tableau. Since x 4, x 5 are slack variables with associated columns A 4 = e 1 and A 5 = e 2 in the constraint matrix A we have p 1 = c 4 = 1/3, p 2 = c 5 = 2. (b) The dual is max 3p 1 6p 2 s.t. 2p 1 4 3p 2 6 3p 1 2p 2 5 p 1, p 2 0. Page 3 / 6
4 In order to check that the solutions x = (0, 4/3, 1, 0, 0) and p = ( 1/3, 2) obtained in point (a) are optimal we first verify that they are both feasible: 2x 1 3x 3 + x 4 = = 3 3x 2 2x 3 + x 5 = 3 4/ = 6 x 1 = 0 0, x 2 = 4/3 0, x 3 = 1 0, x 4 = 0 0, x 5 = 0 0 and thus x satisfies all primal constraints; 2p 1 = 2 1/3 = 2/3 4 3p 2 = 3 2 = 6 6 3p 1 2p 2 = 3 1/3 2 2 = 5 5 p 1 = 1/3 0, p 2 = 2 0 and thus p satisfies all dual constraints. Now, since c x = p b = 13 from the corollary to the weak duality theorem we have that both x and p are optimal (it can also be checked that they satisfy the complementary slackness conditions). Problem 2 (a) True. Since x is a basic primal solution associated with B its cost is c B x B = c B B 1 b where x B and c B are the vectors formed by the basic variables and their costs, respectively. Since p is a basic dual solution associated with B its cost is p b = c B B 1 b. Thus, x and p are both feasible and have the same cost and are optimal by the corollary to the weak duality theorem. It can also be observed that x and p satisfy the complementary slackness conditions and are both feasible thus optimal. (b) False. If the basic solution before pivoting is degenerate and the leaving variable has value 0, then the pivoting operation will not change the value of any variable and after pivoting we have the same basic solution. (c) False. If the optimal cost of the primal is then by weak duality the dual can only be infeasible. Problem 3 (a) The optimal solution shown in the tableau has basic variables x 1, x 5, and x 3. The optimal basis is formed by the corresponding columns A 1, A 5, and A 3 of the constraint matrix A. The optimal basis matrix is B = [ ] A 1 A 5 A 3 = The optimal dual solution is p = (0, 0, 2). It can be obtained from the tableau since x 4, x 5, x 6 are slack variables with associated columns A 4 = e 1, A 5 = e 2, A 6 = e 3 : 0 = c 4 = c 4 c B B 1 A 4 = c 4 p A 4 = c 4 p e 1 = 0 p 1 p 1 = 0; 0 = c 5 = c 5 c B B 1 A 5 = c 5 p A 5 = c 5 p e 2 = 0 p 2 p 2 = 0; 2 = c 6 = c 6 c B B 1 A 6 = c 6 p A 6 = c 6 p e 3 = 0 p 3 p 3 = 2; Page 4 / 6
5 (b) The solution x is not the unique optimal solution. We note that the reduced cost c 4 of the non-basic variable x 4 is zero. If we let x 4 enter the basis then the basic variable x 5 must leave the basis, and since x 5 > 0 and c 4 = 0 we obtain a different basic feasible solution with the same cost as x. To compute the new solution we make a pivoting operation on row 2 and column 4: z x 1 x 2 x 3 x 4 x 5 x /2 0 1/2* 1 0 1/2 0 1/4 1-1/4 0 1/2 z x 1 x 2 x 3 x 4 x 5 x / /2 1/2 (c) The current basis remains optimal if all reduced costs remain non-negative after the cost change. Since x 3 is a basic variable and c 3 is changed to δ, the basic cost vector c B = (c 1, c 5, c 3 ) becomes c B = ( 2, 0, δ). The reduced costs of non-basic variables become: c 2 = c 2 c B B 1 A 2 = 1 [ 2 0 δ ] 0 1/2 = 1 + 1/4δ; 1/4 c 4 = c 4 c B B 1 A 4 = 0 [ 2 0 δ ] 0 1/2 = 0 + 1/4δ; 1/4 c 6 = c 6 c B B 1 A 6 = 0 [ 2 0 δ ] 1 0 = /2δ; 1/2 Form the above, the reduced costs remain non-negative if δ 4, δ 0, and δ 4, that is, 0 δ 4. If δ is outside this range, then the current basis remains primalfeasible, and we can apply the primal Simplex method. We would first recompute the reduced costs and update the zeroth row of the tableau, and then proceed with the primal Simplex method. (d) If the cost of x 2 is changed to 1 the reduced cost of x 2 becomes c 2 = c 2 c B B 1 A 2 = 1 [ ] 0 1/2 = 1 and the current basis is not optimal anymore. Variable x 2 has negative reduced cost and must enter the basis, but all elements in the 1/4 corresponding column of the tableau are negative. This indicates that the optimal cost is. Since all the elements in the column of x 2 in the tableau are non-positive the corresponding basic direction d 2 has all non-negative components which means that we Page 5 / 6
6 can construct a feasible solution x + θd 2 with cost c x + θ c 2 = c x θ (since c 2 = 1) for any θ 0 starting from any feasible solution x. From the tableau, we obtain d 2 = (0, 1, 1/4, 0, 1/2, 0). Starting from x = (0, 0, 0, 2, 0, 2) which is feasible and has cost 0, we obtain x + θd 2 = (0, θ, 1/4θ, 2, 1/2θ, 2) which is feasible and has cost θ. For any θ = M 0 we have a feasible solution of cost M. Problem 4 (a) Recall that one of the flow conservation constraints of a minimum cost network flow problem is redundant. We thus assume that the flow conservation constraint of node 7 has been removed from the problem, and for convenience we adopt the convention p 7 = 0 (where p 7 would be the dual variable associated with the removed constraint). Before the iteration. (i) T = {(1, 4), (4, 2), (2, 5), (4, 3), (3, 6), (6, 7)}, and the corresponding tree solution is f 14 = 100, f 42 = 50, f 25 = 50, f 43 = 50, f 36 = 40, f 67 = 60, f ij = 0, (i, j) T. (ii) The dual variables are computed as p i p j = c ij, (i, j) T (where we assume p 7 = 0). We obtain: p 6 = 7, p 3 = 9, p 4 = 14, p 1 = 15, p 2 = 12, p 5 = 9. (iii) To find an entering variable we compute the reduced costs for the arcs not in T as c ij = c ij p i + p j (where we assume p 7 = 0), until we find one which is negative (if there is one). Since c 47 = 8 14 < 0, f 47 is the entering variable and arc (4, 7) is added to T. This closes the cycle formed by arcs (4, 7), (6, 7), (3, 6), (4, 3) among which arcs (6, 7), (3, 6), (4, 3) are backward. The maximum flow that can be pushed around this cycle is θ = min{f 67, f 36, f 43 } = 40. A flow amount θ is added to arc (4, 7) and subtracted from arcs (6, 7), (3, 6), (4, 3). The variable f 36 becomes 0 and leaves the basis, and arc (3, 6) is removed from T. After the iteration. (i) T = {(1, 4), (4, 2), (2, 5), (4, 3), (4, 7), (6, 7)}, and the corresponding tree solution is f 14 = 100, f 42 = 50, f 25 = 50, f 43 = 10, f 47 = 40, f 67 = 20, f ij = 0, (i, j) T. (ii) The dual variables are computed as p i p j = c ij, (i, j) T (where we assume p 7 = 0). We obtain: p 6 = 7, p 4 = 8, p 3 = 3, p 1 = 9, p 2 = 6, p 5 = 3. (b) The reduced costs of non-basic variables after the iteration are: c 12 = = 1, c 13 = = 0, c 34 = = 10, c 36 = = 6, c 54 = = 11, c 57 = = 6, and c 64 = = 5. All reduced costs are non-negative and the optimality condition of the network Simplex algorithm is met. Both the primal and dual solutions obtained after the iteration at the end of point (a) are optimal. The dual solution is degenerate because the reduced cost of the non-basic variable f 13 is zero. Page 6 / 6
min 4x 1 5x 2 + 3x 3 s.t. x 1 + 2x 2 + x 3 = 10 x 1 x 2 6 x 1 + 3x 2 + x 3 14
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. If necessary,
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationSensitivity Analysis
Dr. Maddah ENMG 500 /9/07 Sensitivity Analysis Changes in the RHS (b) Consider an optimal LP solution. Suppose that the original RHS (b) is changed from b 0 to b new. In the following, we study the affect
More informationDual Basic Solutions. Observation 5.7. Consider LP in standard form with A 2 R m n,rank(a) =m, and dual LP:
Dual Basic Solutions Consider LP in standard form with A 2 R m n,rank(a) =m, and dual LP: Observation 5.7. AbasisB yields min c T x max p T b s.t. A x = b s.t. p T A apple c T x 0 aprimalbasicsolutiongivenbyx
More informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationFarkas Lemma, Dual Simplex and Sensitivity Analysis
Summer 2011 Optimization I Lecture 10 Farkas Lemma, Dual Simplex and Sensitivity Analysis 1 Farkas Lemma Theorem 1. Let A R m n, b R m. Then exactly one of the following two alternatives is true: (i) x
More informationSummary of the simplex method
MVE165/MMG630, The simplex method; degeneracy; unbounded solutions; infeasibility; starting solutions; duality; interpretation Ann-Brith Strömberg 2012 03 16 Summary of the simplex method Optimality condition:
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
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 informationSystems Analysis in Construction
Systems Analysis in Construction CB312 Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d 3. Linear Programming Optimization Simplex Method 135
More informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
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 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 informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More informationThe Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006
The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,
More informationCO350 Linear Programming Chapter 8: Degeneracy and Finite Termination
CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination 27th June 2005 Chapter 8: Finite Termination 1 The perturbation method Recap max c T x (P ) s.t. Ax = b x 0 Assumption: B is a feasible
More informationLecture 11: Post-Optimal Analysis. September 23, 2009
Lecture : Post-Optimal Analysis September 23, 2009 Today Lecture Dual-Simplex Algorithm Post-Optimal Analysis Chapters 4.4 and 4.5. IE 30/GE 330 Lecture Dual Simplex Method The dual simplex method will
More informationLinear Programming: Chapter 5 Duality
Linear Programming: Chapter 5 Duality Robert J. Vanderbei September 30, 2010 Slides last edited on October 5, 2010 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544
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 informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More informationMath 16 - Practice Final
Math 16 - Practice Final May 28th 2007 Name: Instructions 1. In Part A, attempt every question. In Part B, attempt two of the five questions. If you attempt more you will only receive credit for your best
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 informationSAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.
SAMPLE QUESTIONS. (a) We first set up some constant vectors for our constraints. Let b = (30, 0, 40, 0, 0) T, c = (60, 000, 30, 600, 900) T. Then we set up variables x ij, where i, j and i + j 6. By using
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 9: Duality and Complementary Slackness Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationThe Simplex Algorithm
8.433 Combinatorial Optimization The Simplex Algorithm October 6, 8 Lecturer: Santosh Vempala We proved the following: Lemma (Farkas). Let A R m n, b R m. Exactly one of the following conditions is true:.
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
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 informationYinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method
The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapters 2.3-2.5, 3.1-3.4) 1 Geometry of Linear
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 informationDM545 Linear and Integer Programming. Lecture 7 Revised Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation
More informationMath Models of OR: Sensitivity Analysis
Math Models of OR: Sensitivity Analysis John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 8 USA October 8 Mitchell Sensitivity Analysis / 9 Optimal tableau and pivot matrix Outline Optimal
More informationDiscrete Optimization
Prof. Friedrich Eisenbrand Martin Niemeier Due Date: April 15, 2010 Discussions: March 25, April 01 Discrete Optimization Spring 2010 s 3 You can hand in written solutions for up to two of the exercises
More information3. THE SIMPLEX ALGORITHM
Optimization. THE SIMPLEX ALGORITHM DPK Easter Term. Introduction We know that, if a linear programming problem has a finite optimal solution, it has an optimal solution at a basic feasible solution (b.f.s.).
More information2018 년전기입시기출문제 2017/8/21~22
2018 년전기입시기출문제 2017/8/21~22 1.(15) Consider a linear program: max, subject to, where is an matrix. Suppose that, i =1,, k are distinct optimal solutions to the linear program. Show that the point =, obtained
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 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 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 informationMinimum cost transportation problem
Minimum cost transportation problem Complements of Operations Research Giovanni Righini Università degli Studi di Milano Definitions The minimum cost transportation problem is a special case of the minimum
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationMATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00
MATH 373 Section A1 Final Exam Dr. J. Bowman 17 December 2018 14:00 17:00 Name (Last, First): Student ID: Email: @ualberta.ca Scrap paper is supplied. No notes or books are permitted. All electronic equipment,
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 22 October 22, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 16 Table of Contents 1 The Simplex Method, Part II Ming Zhong (JHU) AMS Fall 2018 2 /
More informationAM 121: Intro to Optimization
AM 121: Intro to Optimization Models and Methods Lecture 6: Phase I, degeneracy, smallest subscript rule. Yiling Chen SEAS Lesson Plan Phase 1 (initialization) Degeneracy and cycling Smallest subscript
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 informationRevised Simplex Method
DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More information"SYMMETRIC" PRIMAL-DUAL PAIR
"SYMMETRIC" PRIMAL-DUAL PAIR PRIMAL Minimize cx DUAL Maximize y T b st Ax b st A T y c T x y Here c 1 n, x n 1, b m 1, A m n, y m 1, WITH THE PRIMAL IN STANDARD FORM... Minimize cx Maximize y T b st Ax
More informationFoundations of Operations Research
Solved exercises for the course of Foundations of Operations Research Roberto Cordone The dual simplex method Given the following LP problem: maxz = 5x 1 +8x 2 x 1 +x 2 6 5x 1 +9x 2 45 x 1,x 2 0 1. solve
More informationThe use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:
Sensitivity analysis The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Changing the coefficient of a nonbasic variable
More informationIntroduction to Mathematical Programming IE406. Lecture 13. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 13 Dr. Ted Ralphs IE406 Lecture 13 1 Reading for This Lecture Bertsimas Chapter 5 IE406 Lecture 13 2 Sensitivity Analysis In many real-world problems,
More information3 The Simplex Method. 3.1 Basic Solutions
3 The Simplex Method 3.1 Basic Solutions In the LP of Example 2.3, the optimal solution happened to lie at an extreme point of the feasible set. This was not a coincidence. Consider an LP in general form,
More informationOperations Research Lecture 2: Linear Programming Simplex Method
Operations Research Lecture 2: Linear Programming Simplex Method Notes taken by Kaiquan Xu@Business School, Nanjing University Mar 10th 2016 1 Geometry of LP 1.1 Graphical Representation and Solution Example
More information9.1 Linear Programs in canonical form
9.1 Linear Programs in canonical form LP in standard form: max (LP) s.t. where b i R, i = 1,..., m z = j c jx j j a ijx j b i i = 1,..., m x j 0 j = 1,..., n But the Simplex method works only on systems
More informationLecture 5. x 1,x 2,x 3 0 (1)
Computational Intractability Revised 2011/6/6 Lecture 5 Professor: David Avis Scribe:Ma Jiangbo, Atsuki Nagao 1 Duality The purpose of this lecture is to introduce duality, which is an important concept
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 informationSimplex Algorithm Using Canonical Tableaus
41 Simplex Algorithm Using Canonical Tableaus Consider LP in standard form: Min z = cx + α subject to Ax = b where A m n has rank m and α is a constant In tableau form we record it as below Original Tableau
More informationAnn-Brith Strömberg. Lecture 4 Linear and Integer Optimization with Applications 1/10
MVE165/MMG631 Linear and Integer Optimization with Applications Lecture 4 Linear programming: degeneracy; unbounded solution; infeasibility; starting solutions Ann-Brith Strömberg 2017 03 28 Lecture 4
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 informationCO350 Linear Programming Chapter 6: The Simplex Method
CO50 Linear Programming Chapter 6: The Simplex Method rd June 2005 Chapter 6: The Simplex Method 1 Recap Suppose A is an m-by-n matrix with rank m. max. c T x (P ) s.t. Ax = b x 0 On Wednesday, we learned
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 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 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 informationMetode Kuantitatif Bisnis. Week 4 Linear Programming Simplex Method - Minimize
Metode Kuantitatif Bisnis Week 4 Linear Programming Simplex Method - Minimize Outlines Solve Linear Programming Model Using Graphic Solution Solve Linear Programming Model Using Simplex Method (Maximize)
More informationMATH 445/545 Homework 2: Due March 3rd, 2016
MATH 445/545 Homework 2: Due March 3rd, 216 Answer the following questions. Please include the question with the solution (write or type them out doing this will help you digest the problem). I do not
More information4. The Dual Simplex Method
4. The Dual Simplex Method Javier Larrosa Albert Oliveras Enric Rodríguez-Carbonell Problem Solving and Constraint Programming (RPAR) Session 4 p.1/34 Basic Idea (1) Algorithm as explained so far known
More informationThe dual simplex method with bounds
The dual simplex method with bounds Linear programming basis. Let a linear programming problem be given by min s.t. c T x Ax = b x R n, (P) where we assume A R m n to be full row rank (we will see in the
More informationDr. Maddah ENMG 500 Engineering Management I 10/21/07
Dr. Maddah ENMG 500 Engineering Management I 10/21/07 Computational Procedure of the Simplex Method The optimal solution of a general LP problem is obtained in the following steps: Step 1. Express the
More informationLecture Simplex Issues: Number of Pivots. ORIE 6300 Mathematical Programming I October 9, 2014
ORIE 6300 Mathematical Programming I October 9, 2014 Lecturer: David P. Williamson Lecture 14 Scribe: Calvin Wylie 1 Simplex Issues: Number of Pivots Question: How many pivots does the simplex algorithm
More informationThe Strong Duality Theorem 1
1/39 The Strong Duality Theorem 1 Adrian Vetta 1 This presentation is based upon the book Linear Programming by Vasek Chvatal 2/39 Part I Weak Duality 3/39 Primal and Dual Recall we have a primal linear
More informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More informationLecture 2: The Simplex method
Lecture 2 1 Linear and Combinatorial Optimization Lecture 2: The Simplex method Basic solution. The Simplex method (standardform, b>0). 1. Repetition of basic solution. 2. One step in the Simplex algorithm.
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 information(includes both Phases I & II)
(includes both Phases I & II) Dennis ricker Dept of Mechanical & Industrial Engineering The University of Iowa Revised Simplex Method 09/23/04 page 1 of 22 Minimize z=3x + 5x + 4x + 7x + 5x + 4x subject
More informationCSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming
CSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming January 26, 2018 1 / 38 Liability/asset cash-flow matching problem Recall the formulation of the problem: max w c 1 + p 1 e 1 = 150
More informationCPS 616 ITERATIVE IMPROVEMENTS 10-1
CPS 66 ITERATIVE IMPROVEMENTS 0 - APPROACH Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change
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 informationmin3x 1 + 4x 2 + 5x 3 2x 1 + 2x 2 + x 3 6 x 1 + 2x 2 + 3x 3 5 x 1, x 2, x 3 0.
ex-.-. Foundations of Operations Research Prof. E. Amaldi. Dual simplex algorithm Given the linear program minx + x + x x + x + x 6 x + x + x x, x, x. solve it via the dual simplex algorithm. Describe
More informationThe augmented form of this LP is the following linear system of equations:
1 Consider the following LP given in standard form: max z = 5 x_1 + 2 x_2 Subject to 3 x_1 + 2 x_2 2400 x_2 800 2 x_1 1200 x_1, x_2 >= 0 The augmented form of this LP is the following linear system of
More informationIntroduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we
More information1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations
The Simplex Method Most textbooks in mathematical optimization, especially linear programming, deal with the simplex method. In this note we study the simplex method. It requires basically elementary linear
More informationWeek 4. (1) 0 f ij u ij.
Week 4 1 Network Flow Chapter 7 of the book is about optimisation problems on networks. Section 7.1 gives a quick introduction to the definitions of graph theory. In fact I hope these are already known
More informationmaxz = 3x 1 +4x 2 2x 1 +x 2 6 2x 1 +3x 2 9 x 1,x 2
ex-5.-5. Foundations of Operations Research Prof. E. Amaldi 5. Branch-and-Bound Given the integer linear program maxz = x +x x +x 6 x +x 9 x,x integer solve it via the Branch-and-Bound method (solving
More informationFebruary 17, Simplex Method Continued
15.053 February 17, 2005 Simplex Method Continued 1 Today s Lecture Review of the simplex algorithm. Formalizing the approach Alternative Optimal Solutions Obtaining an initial bfs Is the simplex algorithm
More informationToday s class. Constrained optimization Linear programming. Prof. Jinbo Bi CSE, UConn. Numerical Methods, Fall 2011 Lecture 12
Today s class Constrained optimization Linear programming 1 Midterm Exam 1 Count: 26 Average: 73.2 Median: 72.5 Maximum: 100.0 Minimum: 45.0 Standard Deviation: 17.13 Numerical Methods Fall 2011 2 Optimization
More informationExample. 1 Rows 1,..., m of the simplex tableau remain lexicographically positive
3.4 Anticycling Lexicographic order In this section we discuss two pivoting rules that are guaranteed to avoid cycling. These are the lexicographic rule and Bland s rule. Definition A vector u R n is lexicographically
More informationIntroduction to Linear and Combinatorial Optimization (ADM I)
Introduction to Linear and Combinatorial Optimization (ADM I) Rolf Möhring based on the 20011/12 course by Martin Skutella TU Berlin WS 2013/14 1 General Remarks new flavor of ADM I introduce linear and
More informationTermination, Cycling, and Degeneracy
Chapter 4 Termination, Cycling, and Degeneracy We now deal first with the question, whether the simplex method terminates. The quick answer is no, if it is implemented in a careless way. Notice that we
More informationDecember 2014 MATH 340 Name Page 2 of 10 pages
December 2014 MATH 340 Name Page 2 of 10 pages Marks [8] 1. Find the value of Alice announces a pure strategy and Betty announces a pure strategy for the matrix game [ ] 1 4 A =. 5 2 Find the value of
More informationMATH 210 EXAM 3 FORM A November 24, 2014
MATH 210 EXAM 3 FORM A November 24, 2014 Name (printed) Name (signature) ZID No. INSTRUCTIONS: (1) Use a No. 2 pencil. (2) Work on this test. No scratch paper is allowed. (3) Write your name and ZID number
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 informationIE 400: Principles of Engineering Management. Simplex Method Continued
IE 400: Principles of Engineering Management Simplex Method Continued 1 Agenda Simplex for min problems Alternative optimal solutions Unboundedness Degeneracy Big M method Two phase method 2 Simplex for
More informationLinear programs Optimization Geoff Gordon Ryan Tibshirani
Linear programs 10-725 Optimization Geoff Gordon Ryan Tibshirani Review: LPs LPs: m constraints, n vars A: R m n b: R m c: R n x: R n ineq form [min or max] c T x s.t. Ax b m n std form [min or max] c
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationc) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns
BUILDING A SIMPLEX TABLEAU AND PROPER PIVOT SELECTION Maximize : 15x + 25y + 18 z s. t. 2x+ 3y+ 4z 60 4x+ 4y+ 2z 100 8x+ 5y 80 x 0, y 0, z 0 a) Build Equations out of each of the constraints above by introducing
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.2. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Basic Feasible Solutions Key to the Algebra of the The Simplex Algorithm
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 information