Solutions to Review Questions, Exam 1
|
|
- Cora Young
- 5 years ago
- Views:
Transcription
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 set is empty. A unique solution (either with or without an unbounded feasible set). An unbounded solution - The feasible set is unbounded. An infinite number of solutions - Either by an unbounded set or the isoprofit lines are coincident with a boundary at the optimum.. The following are to be sure you understand the process of constructing a linear program: (a) Draw a production process diagram and set up the LP for Exercise 6, p. 98 (Sect..9) SOLUTION: See the figure below.
2 (b) Exercise, Chapter review SOLUTIONS: Be sure you can do these graphically. Solution to exercise : The optimal value is 69/7, where we have 6/7 chocolate cake and 66/7 vanilla (yes, the divisibility assumption is violated here). Solution to exercise : The LP is unbounded (no solution). (c) Exercise 6, 8 Chapter review (A ton is lbs) SOLUTIONS: Be sure you introduce your variables! 6. Let x be the pounds of Alloy used to produce one ton of steel and x be the pounds of Alloy. Then the objective function is: With: Carbon constraints: min z = 9/x + /x.x +.4x (.)().x +.4x (.5)() Silicon:.x +.5x (.8)().x +.5x (.5)() Lastly, nickel: Tensile strength:.x +.5x 8.x +.5x 4 4, x + 5, x, 45, Relationship between variables: x + x = Non-negative: x,. An interesting application of blending - The solution is in the back of the text. (d) Exercise, Chapter review. Hint: Consider using a triple index on your variables. SOLUTION: Let x ijk is the units of product, machine i, month j, for sale in month k. Let y ijk is the units of product, machine i, month j, for sale in month k. In order to simplify things, we note some quantities that are useful: Amount of Product for sale in Month : x + x Amount of Product for sale in Month : y + y Amount of Product for sale in Month : x + x + x + x Amount of Product for sale in Month : y + y + y + y
3 Then we have the objective function to maximize: 55(x +x )+(x +x +x +x )+65(y +y )+(y +y +y +y ) For constraints, here are Machine hour constraints (for Months, ): 4(x + x ) + 7(y + y ) 5 4x + 7y 5 Similarly, for Machine : (x + x ) + 4(y + y ) 5 x + 4y 5 Sales constraints (Month, then Month ): x + x y + y 4 x + x + x + x 9 y + y + y + y Also, all variables are non-negative. (e) Exercise 47, 5 in Chapter review. SOLUTIONS: For Exercise 47, see the back of the book. SOLUTION, Exercise 5: Here is a list of the variables: T, : Number of Type and Turkeys that are purchased D, : Pounds of dark meat used in Cutlet, (resp) W, : Pounds of white meat used in Cutlet, (resp) The objective function is to maximize: 4(W + D ) + (W + D ) T 8T Here are the constraints: (Cutlet demand) W + D 5 (Cutlet demand) W + D (Don t use more white meat than you have) W + W 5T + T (Don t use more dark meat than you have) D + D T + T (7% white meat) W /(W + D ).7 (6% white meat) W /((W + D ).6 T,, D,, and W, are all non-negative.. Convert the following LP to one in standard form. Write the result in matrix-vector form, giving x, c, A, b (from our formulation). with x, y is URS, z. min z = x 4y + z st x 4y 4 x + z 5 y + z x + y + z = SOLUTUION: Let x = [x, y +, y, z, e, s, s T. Then c = [, 4, 4,,,, T A = 4 4 b = 4 5
4 4. Consider again the Wyndoor company example we looked at in class: with x, x both non-negative. min z = x + 5x st x 4 x x + x 8 (a) Rewrite so that it is in standard form. SOLUTION: Define the extra variables x, x 4, x 5. Using the extra variables in order, the constraints become: x + x = 4 x + x 4 = x + x + x 5 = 8 And from this, it is easy to read off the coefficient matrix A. (b) Let s, s, s be the extra variables introduced in the last answer. Is the following a basic solution? Is it a basic feasible solution? x =, x = 6, s = 4, s =, s = 6 Which variables are BV, and which are NBV? SOLUTION: The matrix A has rank. If the solution has n m = 5 = zeros (and it is a solution), then it is a basic solution: Yes, this is a basic solution. It is also a basic feasible solution since every entry of the basic solution is non-negative. The variables x, x and x 5 are the basic variables (BV) and the variables x and x 4 are NBV. (c) Find the basic feasible solution obtained by taking s, s as the non-basic variables. In this case, we can row reduce the augmented matrix (remove columns and 5 from the original): 4 8 In this case, we have the (full) solution: 4 6 x = 4, x =, x =, x 4 = 6, x 5 = 5. Consider Figure, with points A(, ), B(, 4) and C(6, ), D(4, ) and E(4, ). Write the point E as a convex combination of points A, B and C. SOLUTION: First we ll find the point of intersection between line AE and BC. Call it E. We found it to be E ( 58, 4 ) (Sorry about the fractions!). By the time we re done, you should have: [ 4 = [ ( 4 [ [ 6 )
5 Can E be written as a convex combination of A, B and D? If so, construct it. SOLUTION: No. The point E is above the convex hull of A, B and D (which is the triangle whose vertices are at A, B, D). Can A be written as a linear combination of A, B and D? If so, construct it. SOLUTION: Obvious typo there- I meant to say E can be written... Using E, we can set up the matrix and solve: [ If the coefficients for the linear combination are c, c, c, we find them to be: C = 4 C C = + C C = C Therefore, there are an infinite number of ways to make this linear combination (which was expected, since three vectors in IR are not linearly independent). 6. Draw the feasible set corresponding to the following inequalities: with x, x non-negative. x + x 6, x x x, x 6 (a) Find the set of extreme points. SOLUTION: (, ), (, 6), (, ), (, ), (, ). (b) Write the vector [, T as a convex combination of the extreme points. SOLUTION: Since I get to choose, let s make it easy: [ = [ + [ [ [ [ Or, a little more complex: [ = [ [ + [ [ + [ + Figure : Figure for the convex combinations, Exercise 5. 5
6 Figure : Figure for Question (c) True or False: The extreme points of the region can be found by making exactly two of the constraints binding, then solve. SOLUTION: If we follow this recipe, we will get extreme points, but we ll also get non-feasible points (for example, the point (, 6)). Therefore, FALSE. (d) If the objective function is to maximize x + x, then (a) how might I change that into a minimization problem, and (b) solve it. SOLUTION: For part (a), we convert it by minimizing z, or min x x. For part (b), solve it graphically to get that the maximum occurs at (, ) and the maximum is Consider the unbounded feasible region defined by x x 4, x + x with x, x non-negative. Consider the vector p = [5,. (a) Show that p is in the feasible region. SOLUTION: Substitute the values into the constraints to see that they are both valid. (b) Set up the system you would solve in order to write p in the form given in Theorem (provide a specific vector d). SOLUTION: Directions of unboundedness can have slopes between / and, so we could choose d = [, T. But then [5, T [, T is not in the convex hull of the vertices, so we can make d = [, T. Therefore, [ 5 = [ [ [ [ 4 + σ + σ + σ And we could go ahead and solve by inspection, getting σ = /4, σ = and σ = /4. 8. Finish the definition: Two basic feasible solutions are said to be adjacent if: SOLUTION: Two basic feasible solutions are adjacent if they share all but one basic variable. 6
7 9. Let d be a direction of unboundedness. Using the definition, prove that this means that rd is also a direction of unboundedness, for any constant r. SOLUTION: We assume an LP in standard form, so our set S = {x Ax = b}. Then, d is a direction of unboundedness for S if x + λd S for all x S and λ. Therefore, in what is given, we can let u = rd and show that u is a direction of unboundedness: Let x be any point of S and λ. Then: x + λu = x + (λr) d which must be in S since d was a direction of unboundedness.. If C is a convex set, then d is a direction of unboundedness for C iff x + d C for all x C (Use the definition of unboundedness). SOLUTION: We have two directions- d is a direction of unboundedness for C implies x + d C is trivially true, since we can just make λ =. We now show that, if x+d C for all x C, then d is a direction of unboundedness for C: Let x be any point in S, and λ. Then show that x + λd S. Let λ = N + α, where N is a non-negative integer, and α <. Then x + λd = x + (N + α)d = (x + d) + ((N ) + α)d Now, since x = x + d, then x C, we can write this as: x + d + ((N ) + α)d and so on. Therefore, we have that x + Nd S Finally, since x + Nd + d C, then because C is convex, so will the vector x + Nd + αd C.. For an LP in standard form (see above), prove that the vector d is a direction of unboundedness iff Ad = and d. Solution: Show that if Ad =, with d, then d is a direction of unboundedness. Note that this means we have to show that y = x + λd S for every λ. Let x be in the feasible set, x S so that x. Now, Ay = A (x + λd) = Ax + λad = b + = b Wait! We re not done- Check that y (it is since λ, x, d ). Now go in the reverse: Suppose that we know that d is a direction of unboundedness. We show that Ad = and d. 7
8 Let x be in the feasible set. One path we could take is to suppose that, by way of contradiction, that Ad. Then A (x + λd) = Ax + λad = b + λk b But then x + λd is not an element of S (contradiction). The other part: Is d? If not, then at least one coordinate d i <. But then it is possible to find λ so that the i th coordinate of x + λd is negative (contradiction).. Show that the set of optimal solutions to an LP (assume in standard form) is convex. SOLUTION: Define S = { x Ax = b, c T x = L } Now, let y, y S. We show that all points on the line segment between them is also in S. Let y be a point between- Then there is a t so that: y = ty + ( t)y Now, y is also feasible, since And y will give the same optimal value, Ay = tay + ( t)ay = tb + ( t)b = b c T y = tc T y + ( t)c T y = tl + ( t)l = L. Let a feasible region be defined by the system of inequalities below: x + x 6 x + x x x, x The point (4, ) is in the feasible region. Find vectors d and b, b k and constants σ i so that the Representation Theorem is satisfied (NOTE: Your vector x from that theorem is more than two dimensional). SOLUTION: Graphing the region in -d, we see that the extreme points are: [ [ [ b =, b =, b = 4 And d can be any vector pointing outwards with a slope between and /. The easiest method to get the representation is to aim backwards at an extreme point, but using a vector that will be an allowable d. In this case, we can write: [ 4 = [ Using the matrix A from the LP in standard form (with variables in order: x, x, s, s, e ), we have: A = 8 + [ 4
9 From this, it is easy to solve for the remaining dimensions: Ax = b s = 6 + x x s = + x x e = + x And for the vector in the null space, replace (6,, ) by (,, ). Therefore, = + 4. Let a feasible region be defined by the system of inequalities below: x + x x x x + x 5 x, x The point (, ) is in the feasible region. Find vectors d and b, b k and constants σ i so that the Representation Theorem is satisfied (NOTE: Your vector x from that theorem is more than two dimensional). SOLUTION: The point given is between two extreme points, [, T and [, T. Therefore, in two dimensions we have [ [ [ = t + ( t) t = We also get the matrix A in standard form, with column variables (in order): x, x, s, s, s, and s = x x + A = s = x + x + s = x x + 5 From which we get: = + 5. Suppose that λ λ λ n, and let σ,, σ n be non-negative constants so that n σ i =. Show that i= SOLUTION: λ σ λ + σ λ + σ n λ n λ n σ λ + σ λ + σ n λ n σ λ n + σ λ n + σ n λ n = (λ n ) i σ i = λ n (A similar proof works the other way, too) 9
10 6. Show that, if x is in the convex hull of vectors b, b k, then for any constant vector c, { } c T x max c T b i i SOLUTION: If x is in the convex hull of the vectors b i, then we can write x as a convex combination of them: x = α b + + α k b k Taking the dot product of both sides with c, we have: c T x = α (c T b ) + α k (c T b k ) which is the set up to the previous problem with λ j = c T b j. By that exercise, we know that c T x = α (c T b ) + α k (c T b k ) max i { c T b i } SIDE REMARK: Notice that this is a key element of the fundamental theorem of linear programming- The maximum and minimum of the objective function are attained at extreme points. 7. True or False, and explain: The Simplex Method will always choose a basic feasible solution that is adjacent to the current BFS. SOLUTION: That is true. It is because we will only replace one of the current basic variables with a new variable, therefore, the new BFS will keep all but one of the current set of basic variables. 8. Given the current tableau (with variables labeled above the respective columns), answer the questions below. x x s s rhs 4 / / / / 4 (a) Is the tableau optimal (and did your answer depend on whether we are maximizing or minimizing)? For the remaining questions, you may assume we are maximizing. ANSWER: This tableau is not optimal for either. If we were minimizing, we could still pivot using s. If we were maximizing, we could still pivot in x. (b) Give the current BFS. ANSWER: The current BFS is x = 4, x =, s = and s =. (c) Directly from the tableau, can I increase x from to and remain feasible? Can I increase it to 4? ANSWER: From the ratio test, x can be increased to in the first, and 6 in the second. However, increasing it to 4 would violate the first constraint. Summary: I can increase x from to, but not to 4. (d) If x is increased from to, compute the new value of z, x, s (assuming s stays zero). SOLUTION: z = 5 x = s =
11 (e) Write the objective function and all variables in terms of the non-basic (or free) variables, and then put them in vector form. SOLUTION: For the current tableau, z = 4 + x s, with x = 4 /x /s x = x x = s = /x + /s s = s 4 + x + s
Review 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 informationThe Simplex Method. Standard form (max) z c T x = 0 such that Ax = b.
The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. Build initial tableau. z c T 0 0 A b The Simplex Method Standard
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 informationThe Simplex Algorithm and Goal Programming
The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is
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 informationOperations Research I: Deterministic Models
AMS 341 (Fall, 2016) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, September 29, 2016 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
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 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 informationThe Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1
The Graphical Method & Algebraic Technique for Solving LP s Métodos Cuantitativos M. En C. Eduardo Bustos Farías The Graphical Method for Solving LP s If LP models have only two variables, they can be
More information1. (7pts) Find the points of intersection, if any, of the following planes. 3x + 9y + 6z = 3 2x 6y 4z = 2 x + 3y + 2z = 1
Math 125 Exam 1 Version 1 February 20, 2006 1. (a) (7pts) Find the points of intersection, if any, of the following planes. Solution: augmented R 1 R 3 3x + 9y + 6z = 3 2x 6y 4z = 2 x + 3y + 2z = 1 3 9
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 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 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 informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions. What does the Representation Theorem say (in linear programming)? In words, the representation theorem says that any feasible point can be written
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 informationMATH 4211/6211 Optimization Linear Programming
MATH 4211/6211 Optimization Linear Programming Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 The standard form of 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 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 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 informationMAT016: Optimization
MAT016: Optimization M.El Ghami e-mail: melghami@ii.uib.no URL: http://www.ii.uib.no/ melghami/ March 29, 2011 Outline for today The Simplex method in matrix notation Managing a production facility The
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 informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for
More informationMath Models of OR: Extreme Points and Basic Feasible Solutions
Math Models of OR: Extreme Points and Basic Feasible Solutions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 1180 USA September 018 Mitchell Extreme Points and Basic Feasible Solutions
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. Consider the following polyhedron of an LP problem: 2x 1 x 2 + 5x 3 = 1 (1) 3x 2 + x 4 5 (2) 7x 1 4x 3 + x 4 4 (3) x 1, x 2, x 4 0
MA Linear Programming Tutorial 3 Solution. Consider the following polyhedron of an LP problem: x x + x 3 = ( 3x + x 4 ( 7x 4x 3 + x 4 4 (3 x, x, x 4 Identify all active constraints at each of the following
More informationIntroduction to linear programming
Chapter 2 Introduction to linear programming 2.1 Single-objective optimization problem We study problems of the following form: Given a set S and a function f : S R, find, if possible, an element x S that
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 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 informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.05 Recitation 8 TAs: Giacomo Nannicini, Ebrahim Nasrabadi At the end of this recitation, students should be able to: 1. Derive Gomory cut from fractional
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 1 Version 1 February 21, 2006 60 points possible 1. (a) (3pts) Define what it means for a linear system to be inconsistent. Solution: A linear system is inconsistent
More informationMath Models of OR: Some Definitions
Math Models of OR: Some Definitions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Some Definitions 1 / 20 Active constraints Outline 1 Active constraints
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 informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Introduction to Optimization (Spring 2004) Midterm Solutions
MASSAHUSTTS INSTITUT OF THNOLOGY 15.053 Introduction to Otimization (Sring 2004) Midterm Solutions Please note that these solutions are much more detailed that what was required on the midterm. Aggregate
More informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
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 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 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 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 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 informationTheory of Linear Programming
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit Two Theory of Linear Programming Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 2: Theory
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 informationFebruary 22, Introduction to the Simplex Algorithm
15.53 February 22, 27 Introduction to the Simplex Algorithm 1 Quotes for today Give a man a fish and you feed him for a day. Teach him how to fish and you feed him for a lifetime. -- Lao Tzu Give a man
More informationMS-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 Graphical representation
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
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 informationReview Solutions for Exam 1
Definitions Basic Theorems. Finish the definition: Review Solutions for Exam (a) A linear combination of vectors {v,..., v n } is: any vector of the form c v + c v + + c n v n (b) A set of vectors {v,...,
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 informationBASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C =
CHAPTER I BASIC NOTIONS (a) 8666 and 8833 (b) a =6,a =4 will work in the first case, but there are no possible such weightings to produce the second case, since Student and Student 3 have to end up with
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 information1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.
1. Determine by inspection which of the following sets of vectors is linearly independent. (a) (d) 1, 3 4, 1 { [ [,, 1 1] 3]} (b) 1, 4 5, (c) 3 6 (e) 1, 3, 4 4 3 1 4 Solution. The answer is (a): v 1 is
More informationMS-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 informationReview Problems Solutions MATH 3300A (01) Optimization Fall Graphically, the optimal solution is found to be x 1 = 36/7, x 2 = 66/7, z = 69/7.
Review Problems Solutions MATH 3300A (01) Optimization Fall 2016 Chapter 3 2. Let x 1 = number of chocolate cakes baked x 2 = number of vanilla cakes baked Then we should solve max z = x 1 +.50x 2 s.t.
More informationThe Simplex Algorithm
The Simplex Algorithm How to Convert an LP to Standard Form Before the simplex algorithm can be used to solve an LP, the LP must be converted into a problem where all the constraints are equations and
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
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 informationmin 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 information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
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 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 informationVariants of Simplex Method
Variants of Simplex Method All the examples we have used in the previous chapter to illustrate simple algorithm have the following common form of constraints; i.e. a i x + a i x + + a in x n b i, i =,,,m
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 informationCHAPTER 2. The Simplex Method
CHAPTER 2 The Simplex Method In this chapter we present the simplex method as it applies to linear programming problems in standard form. 1. An Example We first illustrate how the simplex method works
More informationCLASS NOTES: 2 1 thru 2 3 and 1 1 Solving Inequalities and Graphing
page 1 of 19 CLASS NOTES: 2 1 thru 2 3 and 1 1 Solving Inequalities and Graphing 1 1: Real Numbers and Their Graphs Graph each of the following sets. Positive Integers: { 1, 2, 3, 4, } Origin: { 0} Negative
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 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 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 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 information(b) For the change in c 1, use the row corresponding to x 1. The new Row 0 is therefore: 5 + 6
Chapter Review Solutions. Write the LP in normal form, and the optimal tableau is given in the text (to the right): x x x rhs y y 8 y 5 x x x s s s rhs / 5/ 7/ 9 / / 5/ / / / (a) For the dual, just go
More informationTIM 206 Lecture 3: The Simplex Method
TIM 206 Lecture 3: The Simplex Method Kevin Ross. Scribe: Shane Brennan (2006) September 29, 2011 1 Basic Feasible Solutions Have equation Ax = b contain more columns (variables) than rows (constraints),
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 information6.2: The Simplex Method: Maximization (with problem constraints of the form )
6.2: The Simplex Method: Maximization (with problem constraints of the form ) 6.2.1 The graphical method works well for solving optimization problems with only two decision variables and relatively few
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 informationLINEAR PROGRAMMING I. a refreshing example standard form fundamental questions geometry linear algebra simplex algorithm
Linear programming 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) max c T x s. t. Ax = b Lecture slides
More informationDEPARTMENT OF MATHEMATICS
DEPARTMENT OF MATHEMATICS. Points: 4+7+4 Ma 322 Solved First Exam February 7, 207 With supplements You are given an augmented matrix of a linear system of equations. Here t is a parameter: 0 4 4 t 0 3
More informationLecture 2: The Simplex method. 1. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form.
Lecture 2: The Simplex method. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form. 3. The Simplex algorithm. 4. How to find an initial basic solution. Lecture
More informationAMS341 HW1. Graphically solving this LP we find the optimal solution to be z = $10,000, W = C = 20 acres.
AMS341 HW1 p.63 #6 Let W = acres of wheat planted and C = acres of corn planted. Then the appropriate LP is max = 200W + 300C st W + C 45 (Land) 3W + 2C 100 (Workers) 2W + 4C 120 (Fertilizer) W, C 0 Graphically
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 informationMATH 300, Second Exam REVIEW SOLUTIONS. NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic.
MATH 300, Second Exam REVIEW SOLUTIONS NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic. [ ] [ ] 2 2. Let u = and v =, Let S be the parallelegram
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 informationLecture slides by Kevin Wayne
LINEAR PROGRAMMING I a refreshing example standard form fundamental questions geometry linear algebra simplex algorithm Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM Linear programming
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 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 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 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 informationGraphing Systems of Linear Equations
Graphing Systems of Linear Equations Groups of equations, called systems, serve as a model for a wide variety of applications in science and business. In these notes, we will be concerned only with groups
More informationORF 522. Linear Programming and Convex Analysis
ORF 5 Linear Programming and Convex Analysis Initial solution and particular cases Marco Cuturi Princeton ORF-5 Reminder: Tableaux At each iteration, a tableau for an LP in standard form keeps track of....................
More informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
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 informationSimplex Method in different guises
Simplex Method in different guises The Furniture problem Max 0x + 0x 2 + 20x, subject to x 0, 8x + x 2 + 2x 48, 4x + 2x 2 +.x 20, 2x +.x 2 +.x 8. Canonical form: slack variables s = (s, s 2, s ) 0. Constraints
More informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
More informationSolutions to Math 51 First Exam October 13, 2015
Solutions to Math First Exam October 3, 2. (8 points) (a) Find an equation for the plane in R 3 that contains both the x-axis and the point (,, 2). The equation should be of the form ax + by + cz = d.
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 information1.5 F15 O Brien. 1.5: Linear Equations and Inequalities
1.5: Linear Equations and Inequalities I. Basic Terminology A. An equation is a statement that two expressions are equal. B. To solve an equation means to find all of the values of the variable that make
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 informationSignature: Name (PRINT CLEARLY) and ID number:
AMS 540 / MBA 540 (Fall, 2008) Estie Arkin Linear Programming - Midterm Do all problems. Write your answers on the exam. You are permitted to use the text, your notes and any material handed out in class.
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
More information7.1 Solving Systems of Equations
Date: Precalculus Notes: Unit 7 Systems of Equations and Matrices 7.1 Solving Systems of Equations Syllabus Objectives: 8.1 The student will solve a given system of equations or system of inequalities.
More informationPart III: A Simplex pivot
MA 3280 Lecture 31 - More on The Simplex Method Friday, April 25, 2014. Objectives: Analyze Simplex examples. We were working on the Simplex tableau The matrix form of this system of equations is called
More informationSpecial cases of linear programming
Special cases of linear programming Infeasible solution Multiple solution (infinitely many solution) Unbounded solution Degenerated solution Notes on the Simplex tableau 1. The intersection of any basic
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More information