MASSACHUSETTS INSTITUTE OF TECHNOLOGY Introduction to Optimization (Spring 2004) Midterm Solutions
|
|
- Cecil Farmer
- 5 years ago
- Views:
Transcription
1 MASSAHUSTTS INSTITUT OF THNOLOGY Introduction to Otimization (Sring 2004) Midterm Solutions Please note that these solutions are much more detailed that what was required on the midterm. Aggregate midterm statistics are at the end. Problem 1 a) According to the rules of simlex, we ivot in a variable whose 1 st row coefficient is negative. For the tableau given the only variable with a negative coefficient is x 3. b) This question was to test the concet of the min ratio test. The key here is that when taking the ratios for each row RHS oefficient of row /ivot column coefficient of row, we only consider ratios where the ivot column coefficient of row i is non negative. In the examle given this is only true for the row where x 5 is the basic variable. Thus x 5 will leave the basis. There is not a tie when erforming the min ratio test. Problem 2 a) For the objective value of the roblem to be unbounded, we have to have a non-basic column with a negative cost coefficient, and non-ositive elements everywhere in this column. Since column x 4 contains ositive elements, it follows that a (in column x 3 ) must be negative. Hence: a < 0 and c 0 and d 0 and e 0. b) We must ensure that x 4 cannot be ivoted out, and x 3 can be ivoted in. Thus b 0, and a < 0. To be able to ivot x2 out, the corresonding element of the basic row must be ositive. Thus e > 0. Finally, e must win the min-ratio test against c, thus f 3 a < 0 and e > 0 and b 0 and < e c Note that e does not have to win the min-ratio test against d, since d < 0. c) Since b > 0, we cannot ivot in column x 4, thus x 3 is the only otential column, and we need a < 0. To have a degenerate ivot, we have to have a zero in the RHS the ivot row, and this is only ossible if f = 0. Therefore, we will need to ivot on e, thus e > 0. Once f = 0, element e will automatically win the min-ratio test, since all other elements on the RHS are ositive, so we do not need to imose conditions on c or d. The answer is a < 0 and e > 0 and f = 0. Page 1 of 9
2 d) An alternative otimal solution is obtained when a non-basic variable has a zero reduced cost, and since b > 0, the answer is a = 0. Note that we do not need to imose conditions on c, d, or e. ven if all these elements were negative, the roblem would not be unbounded, since a = 0, and not a < 0. We would be able to increase x 3 forever, and would obtain an infinite number of otimal solutions of same cost. Problem 3 a) The change in rofit is within the allowable range of change for the cost coefficient of cars. Therefore the objective value changes to 33420, and all the variables stay the same; that is x 1 =88, x 2 =27.6 and m 1 =98. b) We see that the number of machines available is a binding constraint. The shadow rice is 350 and the allowable decrease is 1.6; therefore, the objective would decrease by $350. c) We are not using all the steel that is available; we would therefore not ay anything for an extra ton of steel. d) We see that the shadow rice of car orders is -20. Furthermore the allowable decrease is 3. The rofit would therefore increase by $40. e) When asked if arco should roduce any jees, the answer is yes (we will always want to roduce at least a art of a jee). When considering all the constraints we notice that we can only roduce a art of a jee, but full credit was given for ricing out as if we would be able to roduce a whole jee, that is the rofit would increase by: $ *$400=$120. Problem 4 Let x 3 = number of jees roduced, then the modified roblem looks like: Max z = 300x x x 3-50m 1 s.t 0.8x 1 + x x 3 - m 1 0 m x x 2 + 2x x 1 + 3x 2 + 4x x 1 -.3x 2 +.7x 3 0 x 1 - x 3 3 -x 1 + x 3 3 x 1 0, x 2 0, x 3 0, m 1 0 Page 2 of 9
3 Problem 5 a) When we draw the feasible region, we find that there are three basic feasible solutions; that is, (1, 3), (2.5, 1.5) and (5, 0). Out of those (1, 3) is otimal with an objective value of 8. The feasible region lies to the right and above the constraints. b) If we draw the second constraint x 1 + x 2 4 as x 1 + x 2 4 +, we note that the otimal solution moves to (1, 3+ ), and the objective value becomes 8 +. The shadow rice is therefore 1. We see that as we make larger, the otimal solution remains at the intersection of the second and third constraint. On the other hand, if < -1, the otimal solution remains at (1, 2). Therefore the allowable range for the right hand side is from 3 to infinity. c) The cost coefficient for x 1 can increase to infinity, and (1,3) remains the otimal solution. (This makes intuitive sense since when the cost coefficient of x 1 becomes very large we will try to make x 1 as small as ossible). On the other hand if we decrease the cost coefficient to 1, the isocost lines become arallel with the second constraint and all oints on the line between (1, 3) and (2.5, 1.5) become otimal. If we decrease the cost coefficient to a value lower than 1,` then (1,3) is no longer otimal. The current otimal solution therefore stays otimal for values between 1 and infinity. Problem 6 a) The shadow rices are the reduced costs of the corresonding slack variables, which can be read from the otimal simlex tableau. The answer is: 0 for 8x 1 + 6x2 + x3 48 (slack variable s 1 ) 10 for 4x1 + 2x x3 20 (slack variable s2) 10 for x + 1.5x + 0.5x 8 (slack variable s 3 ) An alternative solution, which doesn t use the reduced costs of the slack variables directly is as follows. Imagine that we add the column to the RHS in the original tableau. The column becomes in the final tableau, and thus the shadow rice of the first constraint is 0. The shadow rices of the other two constraints are comuted similarly. b) Adding to the rofit er table is the same as increasing the cost coefficient of x 2 to 30+. Thus, in the original tableau, the cost row entry of x 2 will be -30-, and in the final tableau it will be 5-. To stay otimal, we need the non-basic variables to have nonnegative elements in the cost row, thus the only requirement is 5 0 5, and the answer is 5. Page 3 of 9
4 c) hanging the rofit er desk to 60+ means increasing the cost coefficient of x 1 to 60+. The cost row entry of x 1 will be -60- in the original tableau and - in the final tableau. However, because x 1 is a basic variable, its cost row needs to be zero for the tableau to be otimal. Therefore, we add times row 3 of the final tableau, which is (0, 1, 1.25, 0, 0, -0.5, 1.5, 2), to the cost row of the final tableau. The new cost row is (0, , 0, 0, , , ). For otimality we need the cost row coefficients to be non-negative in all columns excet the objective, and thus we obtain the system of equations: , and the answer is / 3 d) We list the decrease in resources caused by roducing one nightstand, and the imact according to the shadow rices ecrease Shadow Price/Unit Imact -1.5 cubic ft. wood hrs. building work hrs. finishing work Total imact -20 By roducing one nightstand, we loose -$20 due to resource consumtion. Since on the other hand, we earn $25, roducing nightstands as art of the otimal solution would be rofitable, and the answer is YS. Problem 7: a) A basic feasible solution is another name for a corner oint. Thus from the diagram the corner oints are and. b) If we are trying to maximize y we are trying to ick the oint that is highest on the y axis and still feasible. Thus the otimal oints are and. c) This was robably the hardest question of the test. Over 85% of the class icked the wrong answer. In the grahical method for otimizing, one moves the isorofit line arallel until it touches the feasible region, and moving it farther makes it leave the feasible region. But there is no isorofit line that can make B and simultaneously otimal. But, there is a way out of this aarent contradiction. The cost could be 0, in which case the entire feasible region is otimal. This is the only ossibility in this case. Thus since A is a feasible oint it is otimal as well. Many students tried to use the fact that if there are two otimal solutions every oint on the line connecting the two otimal solutions must be otimal. They then argued that since A was not on Page 4 of 9
5 this line it was not otimal. The flaw in the reasoning here is that every feasible oint is otimal. An alternative way of seeing that all oints are otimal is as follows: if the line segment joining B and is otimal, then an interior oint is otimal. We learned in recitation 3 that if an interior oint is otimal then all feasible oints are otimal and the objective function is a constant. Hence A must be otimal as well. Problem 8: Part a: Answer: True We have seen many examles in class, on homework, and even one in the exam itself, where slack variables remain in the basis when the simlex algorithm terminates. When we convert an LP to standard form, we add a slack variable to each inequality constraint. If at the otimal oint one of the original LP inequality constraints is not satisfied at equality, then the slack variable added for that constraint will remain in the basis when simlex terminates. Part b: This question was taken directly from recitation 3. The answer to this question is True. The idea we wanted you to get at was that if two corner oints are otimal then all oints along the segment that connects them are otimal. However, surrisingly enough in both classes students came u with the same counter examle, which forced us to start discussing convexity. The counter examle students came u with was: Max y ST the feasible region bellow (The blue region): y x Page 5 of 9
6 Thus students stated that this LP had two otimal solutions (The to oint of each of the two triangles). The flaw in this reasoning is subtle, which is why I think both classes came u with the same examle). The reason why this examle doesn t hold is because the feasible region above is not a ossible feasible region for an LP. One cannot have an intersection of inequality constraints that leads to this feasible region. More generally, the feasible region for an LP is always convex. The easiest way to think of a convex region is one where if you take any two oints in the region and connect them with a line, every oint on this line lies in the feasible region. Thus the region in the icture above is not convex and thus it would be not ossible for this region to be exressed in LP constraints. Part c: This question was taken directly from recitation 3. False: onsider the following LP. Max y Subject To: y 2 x 0 y 0 This LP has two corner oints (0,0) and (0,2). However any oint (x, 0) where x 0, is an otimal oint. Thus this LP has an infinite number of otimal oints but has only one BFS that is otimal (0, 0). Part d: Answer: False Two simle counterexamles are: 1. An infeasible LP has no corner oint. 2. The LP Max x + y s.t. x = 1 The feasible region for this LP is a line which has no corner oint. Page 6 of 9
7 Problem 9 a) If Bill were to invest $1 in, he would get $0.7 if N is elected; if Bill were to invest $1 in, he would get $0.9 if B is elected. Therefore, Bill would invest in, and get at least $1.1 for each $1 invested. b) The nonlinear rogram is max s.t. min { , , } +,, + 0. = 1 After converting to an LP, we obtain the answer: max s.t. z +,, z 1.5 z 1.1 z = c) Let be the roortion of money invested in stock. If B is elected, the ayoff is (1-). If K is elected, the ayoff is (1-). The worst case ayoff is the lower of these two. The best worst case ayoff is when these two ayoffs are equal, that is when (1 ) = (1 ) 0.2 = 0.6 =. 3 Hence, the answer is to invest 1/3 of $500,000 in stock, and 2/3 in stock. The following lot illustrates the reasoning above. return on investment Page 7 of 9
8 Statistics The mean, median, and standard deviation are rovided both in oints and in ercent, given that the test was out of 110. Points % Mean Median Standard deviation Highest score The following histogram illustrates the distribution of grades. Bin Frequency For examle, bin 90 contains all the grades between 80 and 90. Page 8 of 9
9 The following is a chart of the histogram. Histogram Frequency Frequency Bin Page 9 of 9
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 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 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 informationEcon 101A Midterm 2 Th 8 April 2009.
Econ A Midterm Th 8 Aril 9. You have aroximately hour and minutes to answer the questions in the midterm. I will collect the exams at. shar. Show your work, and good luck! Problem. Production (38 oints).
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 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 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 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 informationAM 221: Advanced Optimization Spring Prof. Yaron Singer Lecture 6 February 12th, 2014
AM 221: Advanced Otimization Sring 2014 Prof. Yaron Singer Lecture 6 February 12th, 2014 1 Overview In our revious lecture we exlored the concet of duality which is the cornerstone of Otimization Theory.
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 informationMeasuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114)
Objectives 1.3 Density curves and Normal distributions Density curves Measuring center and sread for density curves Normal distributions The 68-95-99.7 (Emirical) rule Standardizing observations Calculating
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 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 informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationMeasuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114)
Objectives Density curves Measuring center and sread for density curves Normal distributions The 68-95-99.7 (Emirical) rule Standardizing observations Calculating robabilities using the standard Normal
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 informationEcon 172A, Fall 2007: Midterm A
Econ 172A, Fall 2007: Midterm A Instructions The examination has 5 questions. Answer them all. You must justify your answers to Questions 1, 2, and 5. (if you are not certain what constitutes adequate
More information19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017
th Bay Area Mathematical Olymiad February, 07 Problems and Solutions BAMO- and BAMO- are each 5-question essay-roof exams, for middle- and high-school students, resectively. The roblems in each exam are
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 informationOPRE 6201 : 3. Special Cases
OPRE 6201 : 3. Special Cases 1 Initialization: The Big-M Formulation Consider the linear program: Minimize 4x 1 +x 2 3x 1 +x 2 = 3 (1) 4x 1 +3x 2 6 (2) x 1 +2x 2 3 (3) x 1, x 2 0. Notice that there are
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 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 informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
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 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 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 informationEcon 401A: Economic Theory Mid-term. Answers
. Labor suly Econ 40: Economic Theory Mid-term nswers (a) Let be labor suly. Then x 4 The key ste is setting u the budget constraint. x w w(4 x ) Thus the budget constraint can be rewritten as follows:
More information15-451/651: Design & Analysis of Algorithms October 23, 2018 Lecture #17: Prediction from Expert Advice last changed: October 25, 2018
5-45/65: Design & Analysis of Algorithms October 23, 208 Lecture #7: Prediction from Exert Advice last changed: October 25, 208 Prediction with Exert Advice Today we ll study the roblem of making redictions
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 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 information2.098/6.255/ Optimization Methods Practice True/False Questions
2.098/6.255/15.093 Optimization Methods Practice True/False Questions December 11, 2009 Part I For each one of the statements below, state whether it is true or false. Include a 1-3 line supporting sentence
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 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 informationNotes on Simplex Algorithm
Notes on Simplex Algorithm CS 9 Staff October 8, 7 Until now, we have represented the problems geometrically, and solved by finding a corner and moving around Now we learn an algorithm to solve this without
More informationSimplex Method for LP (II)
Simplex Method for LP (II) Xiaoxi Li Wuhan University Sept. 27, 2017 (week 4) Operations Research (Li, X.) Simplex Method for LP (II) Sept. 27, 2017 (week 4) 1 / 31 Organization of this lecture Contents:
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 Programming, Lecture 4
Linear Programming, Lecture 4 Corbett Redden October 3, 2016 Simplex Form Conventions Examples Simplex Method To run the simplex method, we start from a Linear Program (LP) in the following standard simplex
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 informationPROFIT MAXIMIZATION. π = p y Σ n i=1 w i x i (2)
PROFIT MAXIMIZATION DEFINITION OF A NEOCLASSICAL FIRM A neoclassical firm is an organization that controls the transformation of inuts (resources it owns or urchases into oututs or roducts (valued roducts
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite
More information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
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 informationOPTIMISATION /09 EXAM PREPARATION GUIDELINES
General: OPTIMISATION 2 2008/09 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and
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 informationMath 381 Midterm Practice Problem Solutions
Math 381 Midterm Practice Problem Solutions Notes: -Many of the exercises below are adapted from Operations Research: Applications and Algorithms by Winston. -I have included a list of topics covered on
More informationMicroeconomics Fall 2017 Problem set 1: Possible answers
Microeconomics Fall 07 Problem set Possible answers Each answer resents only one way of solving the roblem. Other right answers are ossible and welcome. Exercise For each of the following roerties, draw
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 informationPreliminary Round Question Booklet
First Annual Pi Day Mathematics Cometition Question Booklet 016 goes on and on, and e is just as cursed. Iwonder,howdoes begin When its digits are reversed? -MartinGardner Pi Day Mathematics Cometition
More informationSeries Handout A. 1. Determine which of the following sums are geometric. If the sum is geometric, express the sum in closed form.
Series Handout A. Determine which of the following sums are geometric. If the sum is geometric, exress the sum in closed form. 70 a) k= ( k ) b) 50 k= ( k )2 c) 60 k= ( k )k d) 60 k= (.0)k/3 2. Find the
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 informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
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 informationCMSC 425: Lecture 4 Geometry and Geometric Programming
CMSC 425: Lecture 4 Geometry and Geometric Programming Geometry for Game Programming and Grahics: For the next few lectures, we will discuss some of the basic elements of geometry. There are many areas
More informationGauss-Jordan Elimination for Solving Linear Equations Example: 1. Solve the following equations: (3)
The Simple Method Gauss-Jordan Elimination for Solving Linear Equations Eample: Gauss-Jordan Elimination Solve the following equations: + + + + = 4 = = () () () - In the first step of the procedure, we
More informationHomework Solution 4 for APPM4/5560 Markov Processes
Homework Solution 4 for APPM4/556 Markov Processes 9.Reflecting random walk on the line. Consider the oints,,, 4 to be marked on a straight line. Let X n be a Markov chain that moves to the right with
More informationLecture 14: Introduction to Decision Making
Lecture 14: Introduction to Decision Making Preferences Utility functions Maximizing exected utility Value of information Actions and consequences So far, we have focused on ways of modeling a stochastic,
More information5.1 THE ROBINSON CRUSOE ECONOMY
Essential Microeconomics -- 5 THE ROBINSON CRUSOE ECONOMY Ke ideas: Walrasian equilibrium allocation, otimal allocation, invisible hand at work A simle econom with roduction Two commodities, H consumers,
More informationEconomics 101. Lecture 7 - Monopoly and Oligopoly
Economics 0 Lecture 7 - Monooly and Oligooly Production Equilibrium After having exlored Walrasian equilibria with roduction in the Robinson Crusoe economy, we will now ste in to a more general setting.
More informationMANAGEMENT SCIENCE doi /mnsc ec
MANAGEMENT SCIENCE doi 0287/mnsc0800993ec e-comanion ONLY AVAILABLE IN ELECTRONIC FORM informs 2009 INFORMS Electronic Comanion Otimal Entry Timing in Markets with Social Influence by Yogesh V Joshi, David
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 information56:171 Operations Research Midterm Exam--15 October 2002
Name 56:171 Operations Research Midterm Exam--15 October 2002 Possible Score 1. True/False 25 _ 2. LP sensitivity analysis 25 _ 3. Transportation problem 15 _ 4. LP tableaux 15 _ Total 80 _ Part I: True(+)
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 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 informationA = Chapter 6. Linear Programming: The Simplex Method. + 21x 3 x x 2. C = 16x 1. + x x x 1. + x 3. 16,x 2.
Chapter 6 Linear rogramming: The Simple Method Section The Dual roblem: Minimization with roblem Constraints of the Form Learning Objectives for Section 6. Dual roblem: Minimization with roblem Constraints
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 informationAssignment for M.Sc. (Maths) Part II (Sem. - III) Distance Mode.
Assignment for M.Sc. (Maths) Part II (Sem. - III) Distance Mode. Last Date for Assignment Submission: - 10 th October, 2016 16 th Mar. 2016 These assignments are to be submitted only by those students
More informationOPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES
General: OPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and homework.
More information29 Linear Programming
29 Linear Programming Many problems take the form of optimizing an objective, given limited resources and competing constraints If we can specify the objective as a linear function of certain variables,
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 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 informationIn Chapters 3 and 4 we introduced linear programming
SUPPLEMENT The Simplex Method CD3 In Chapters 3 and 4 we introduced linear programming and showed how models with two variables can be solved graphically. We relied on computer programs (WINQSB, Excel,
More information4.3 Minimizing & Mixed Constraints
Mathematics : Mattingly, Fall 6 8 4. Minimizing & Mixed Constraints So far, you have seen how to solve one type of problem: Standard Maximum. The objective function is to be maximized.. Constraints use..
More informationMachine Learning: Homework 4
10-601 Machine Learning: Homework 4 Due 5.m. Monday, February 16, 2015 Instructions Late homework olicy: Homework is worth full credit if submitted before the due date, half credit during the next 48 hours,
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 informationMarch 13, Duality 3
15.53 March 13, 27 Duality 3 There are concepts much more difficult to grasp than duality in linear programming. -- Jim Orlin The concept [of nonduality], often described in English as "nondualism," is
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
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 informationTheory of Externalities Partial Equilibrium Analysis
Theory of Externalities Partial Equilibrium Analysis Definition: An externality is resent whenever the well being of a consumer or the roduction ossibilities of a firm are directly affected by the actions
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 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 information7. The olynomial P (x) =x, 9x 4 +9x, 4x +4x, 4 can be written in the form P (x) =(x, ) n Q(x), where n is a ositive integer and Q(x) is not divisible
. Which of the following intervals contains all of the real zeros of the function g(t) =t, t + t? (a) (,; ) (b) ( ; ) (c) (,; ) (d) (; ) (e) (,; ) 4 4. The exression ((a), + b), is equivalent to which
More informationLecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5,
Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method Reading: Sections 2.6.4, 3.5, 10.2 10.5 1 Summary of the Phase I/Phase II Simplex Method We write a typical simplex tableau as z x 1 x
More informationWeek 3 Linear programming duality
Week 3 Linear programming duality This week we cover the fascinating topic of linear programming duality. We will learn that every minimization program has associated a maximization program that has the
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 informationGSOE9210 Engineering Decisions
GSOE9 Engineering Decisions Problem Set 5. Consider the river roblem described in lectures: f f V B A B + (a) For =, what is the sloe of the Bayes indifference line through A? (b) Draw the Bayes indifference
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 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 informationSets of Real Numbers
Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
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 informationCivil Engineering Systems Analysis Lecture XII. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XII Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Dual Midterm 2 Let us look at a complex case
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
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 information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6. Introduction We extend the concet of a finite series, met in section, to the situation in which the number of terms increase without bound. We define what is meant by an infinite series
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 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 informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationOnline Appendix for The Timing and Method of Payment in Mergers when Acquirers Are Financially Constrained
Online Aendix for The Timing and Method of Payment in Mergers when Acquirers Are Financially Constrained Alexander S. Gorbenko USC Marshall School of Business Andrey Malenko MIT Sloan School of Management
More informationDEPARTMENT OF MATHEMATICS
DEPARTMENT OF MATHEMATICS Ma 62 Final Exam December 4, 20 Instructions: No cell phones or network-capable devices are allowed during the exam. You may use calculators, but you must show your work to receive
More information1 Answer Key for exam2162sp07 vl
Ma 162 College Algebra Second Exam vl 9 1 Answer Key for exam2162sp07 vl 1. [ x =, 2, y =, 3, z =, 1, w =, 3, Mary, [63.5, 2, 1]] 2. ABC: 1 L1 L2 1CDE:L1 11 L2 3. P =1.8 x +1.8 y +1.5 z 0 x,0 y 9 x +10y
More information