MASSACHUSETTS INSTITUTE OF TECHNOLOGY
|
|
- Ruby Casey
- 5 years ago
- Views:
Transcription
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Optimization Methods in Management Science (Spring 2007) Problem Set 4 Due March 8 th, 2007 at 4:30 pm. You will need 162 points out of 189 to receive a grade of 5. Problem 1: Phase 1 & Phase 2 (30 Points) The purpose of this problem is to give you practice solving a linear program completely. Donald Trump is too busy getting ready for Wrestlemania and worrying that he may soon look like Britney. Due to this he has no time to solve a linear program to decide how much to invest in three Projects: Project A is to determine how much to sell his casino for in Las Vegas. That is why it is non positive) Project B is a machine to create his new wives each time one ages past 30. Project C is a media campaign to destroy Rosie O Donnell and The View. The variables are a, b, and c. Don t be concerned if the model doesn t make much sense. In order to determine how much he should invest in these projects he has formulated the following linear program not in standard form. min : z = a+ b+ c St : a + 2b + 3c = 3 a + 2b + 6c = 5 a 0 bc, 0 He hires you, a bright student, (Kevin Federline was busy watching The View ) as his apprentice to solve the problem. He gives you the following set of instructions. Don t mess up or else you will be fired. Part A: Page 1 of 12
2 Convert the problem from a min to a max problem Part B: Convert the problem to standard form. Be sure to show all of your steps. Part C: Give an example of a constraint that if added would make the problem infeasible. Part D: Form the auxiliary Phase 1 Problem from the linear program you formulated in part B. Part E: Write out the initial phase one tableau and indicate the initial BFS. Part F: Using the phase one method find an initial BFS of the standard form problem. For each iteration write out the tableau and indicate the pivot element. Hint: You will need three pivots Part F: What is the optimal solution to the phase 1 problem? Part G: Write out the initial tableau for the Phase 2 problem. What is the initial BFS? Part H: Solve the Phase 2 part of the problem using the simplex method. Be sure to write out each of your tableaus and indicate the pivot element on each iteration. Part I: Are there multiple optimal solutions to this problem? Problem 2: Alex and Paris in Paris Texas (28 Points) The purpose of this problem is to get you to think about the geometric and algebraic interplay of the Simplex Method. Page 2 of 12
3 Paris Hilton and Alex Trebeck were having lunch at a café in Paris, Texas. (These were two of your top celebrity choices). After talking about their respective run-ins with the law, they decide to so something more fun. They solve a maximization problem using the simplex method. However halfway through, Paris spills her Jack and Coke on the sheet of paper they were using, blurring some of the entries (these unknown entries are shown with letters in the tableau). Their tableau is shown below: z x 1 x 2 x 3 x 4 x 5 x 6 x 7 RHS C I D E F A B H G 1 3 For each statement find the ranges of the parameters to make the statements correct. If there are multiple sets of ranges that can be used indicate only one. Part A: The current basic solution is feasible. Under this condition, write the current bfs. (You can write your answer in terms of the letters A to H.) Part B: The current tableau is a unique optimal solution to the problem. Part C: x 4 is the only candidate for entering the basis and the problem is unbounded from above. Part D: The current tableau is optimal; however, their also exists an extreme ray of alternative optimal solutions Part E: Assume for this part that D=100, I=100. The current tableau is optimal and there are exactly two BFS s that are optimal. Give two sets of conditions one for each variable that enters the basis first. Part G: Page 3 of 12
4 The current tableau is not optimal, x 6 is the only candidate to enter the basis and when the iteration is performed, x 3 will leave the basis. Part H: The current BFS is degenerate. Part I: The current BFS is degenerate, x 4 enters the basis, and when the pivot is performed, the objective will not improve. (Note that degeneracy does not always lead to the objective not improving.) Problem 3: Degeneracy (33 Points) Degeneracy is one of the most confusing topics. Students struggle with it each year. This problem was designed to help you work through the theoretical aspects of degeneracy in a through manor. Consider the following tableau for a maximization problem. Part A : z x 1 x 2 x 3 x 4 RHS What is the basic feasible solution that corresponds to this tableau? What are the basic and non-basic variables? Part B: Assume x 1,x 2 are slack variables. Draw the feasible region in the x 3 x 4 plane. Part C: Perform one iteration of the simplex method. What is the solution and objective value corresponding to the tableau that you just calculated? How does this solution differ from the basic feasible solution in part A? Part D: Using your graph explained what happened geometrically in part B? Part E: Page 4 of 12
5 Fill in the Blanks: In this problem I just learned that when Blank A is present it is possible to have a Blank B reduced cost and still be at an Blank C. Part F: Now consider a similar tableau. z x 1 x 2 x 3 x 4 RHS Suppose you choose to pivot x 4 into the basis. Perform the pivot and write out the new tableau. Part G: What is the solution you found in Part E? Is it the same solution as in part A? Part H: Fill in the blanks: In this part of the problem I learned that when degeneracy is present it is possible to pivot once to obtain a Blank A solution than the current one, and a strictly Blank B objective value. In fact, the pivot can be non-degenerate. Part I: Suppose the BFS for an optimal tableau is degenerate and a nonbasic variable in row z row has a 0 coefficient. Show by example that it is possible that the LP has a single optimal solution, but possibly has more then one optimal tableau Part J: Suppose the BFS for an optimal tableau is degenerate and a nonbasic variable in row z row has a 0 coefficient. Show by example that it is possible that the LP has multiple optimal solutions but only one corner point that is optimal. Part K: Geometrically the set of optimal solutions to the LP you formulated in Part K is known as what? Page 5 of 12
6 Hey Ollie, Do you think degenerates like degeneracy? O.J Simpson always enjoyed the subject. Problem 4: The Cap n (21 Points) This problem is meant to give you practice on a fairly easy problem on sensitivity analysis. It is meant to cover the basic topics and give you some review. Cap n Crunch is trying to reduce costs for his tasty Crunchberries cereal. Currently he buys crunchy red berries and blue berries on the open market for $3 and $1 per pound respectively. To help reduce costs, he has purchased a 100-acre farm to grow his own tasty, crunchy berries. Each acre planted with berries requires a yearly allotment of water as well as a specified number of hours of labor to harvest. Additionally, each type of berry provides a different yearly yield from the harvest. All of this information is provided in the table below: Red Berries Blue Berries Water (tons per acre per year) Labor (hours per acre per year) Market Price (dollars per pound) $3.00 $1.00 Yearly Yield (pounds per acre) The Cap n s farm is fed by a well which can only pump 6,000 tons of water per year for irrigation. Additionally, the Cap n has found two Operations Research graduate students who will work for peanuts over the summer harvest season to satisfy their practicum requirements. The students provide 225 hours of labor at a fixed cost. All of the resource limitations are provided in the table below: Limit Farm Land (acres) 100 Water (tons per year) 6,000 Labor (hours per year) 225 If the Cap n is capable of using all of the berries he produces, how many acres of each type should he plant to maximize his yearly cost savings? Page 6 of 12
7 For this problem, we will use the following decision variables: x r = Number of acres planted with red berries x b = Number of acres planted with blue berries Thus, we setup our Linear Program as follows: Maximize 270 x r x b (yearly savings) subject to x r + x b 100 (limit on farm land) 50 x r + 75 x b 6000 (limit on water) 2 x r x b 225 (limit on labor) x r, x b 0 After inputting this model into Excel, we receive the following Sensitivity Report: Microsoft Excel 11.0 Sensitivity Report Worksheet: [Sensitivity Analysis.xls]Cap'n Crunch Report Created: 03/05/ :44:59 PM Adjustable Cells Cell Name Final Value Reduced Cost Objective Coefficient Allowable Increase Allowable Decrease $C$16 Acres Red $D$16 Acres Blue Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $C$24 Land Function $C$25 Water Function $C$26 Labor Function E+30 5 Please answer the following questions based on the Sensitivity Report provided above. Part A: What is the optimal solution? What is the optimal objective value (i.e. annual savings)? Part B: How much would the Cap n be willing to pay for an increase of one hour of labor from its current level of 225? Part C: How far would the price per pound of blue berries have to drop before the optimal solution would change? (Hint: Note how the objective function depends on the price of blueberries.) Page 7 of 12
8 Part D: Suppose a neighboring farmer wins 10 acres of the Cap n farmland in a poker match. How much would this reduce the objective value for the LP? Part E: The Cap n is considering planting purple berries at his farm. Currently the Cap n purchases purple berries for $4 per pound. One acre of purple berry plants is expected to yield 80 pounds of purple berries, requiring 3 hours of labor to harvest and 100 tons of water per year. Rewrite the LP including the new variable. Rewrite the LP. List any new decision variables first. Part F: Based on information from the sensitivity report, Should the Cap n plant any acres of purple berries at his farm? Please price out to demonstrate your reasoning. Part G: If the Cap n s team of crack scientists comes up with a method to increase the yearly yield of red berries to 100 pounds per acre will the current solution remain optimal? Problem 5: Nooz and Olli s New Firm (32 Points) This problem will give you practice using excel to help with solving sensitivity analysis problems. [See spreadsheet Problem Set 4.xls.] After failing in the crabbing business Nooz and Ollie have decided to move south(they fly Delta of course!). The pair has decided to open up a commercial printing firm outside of Macon Georgia. Hey Ollie, I Think were gonna like Macon Macon is great, we can take delta connection there. Did you know that was ASA s first destination Page 8 of 12
9 The firm is trying to determine the best mix of printing jobs it should seek, given its current capacity constraints in its four capital-intensive departments: typesetting, camera, pressroom, and bindery. It has classified its commercial work into three classes: A, B, C, each requiring different amounts of time in the four major departments. The production requirements in hours per unit of product are as follows: Department Class of Work A B C Typesetting Camera Pressroom Bindery Assuming these units of work are produced using regular time, the contribution to overhead and profit is $200 for each unit of Class A work, $300 for each unit of Class B, and $100 for each unit of Class C work. The firm currently has the following regular time capacity available in each department for the next time period: typesetting, 50 hours; camera, 90 hours; pressroom, 190 hours; bindery, 170 hours. In addition to this regular time, the firm could utilize an overtime shift in typesetting, which would make available an additional 40 hours in that department. The premium for this overtime (i.e., incremental costs in addition to regular time) would be $4/hour. The firm wants to find the optimal job mix for its equipment, and management assumes it can sell all it produces. However, to satisfy long-established customers, management guarantees that it will produce at least 10 units of each class of work in each time period. Assume that the firm wants to maximize its contribution to profit and overhead. Part A: Formulate as a Linear Programming problem. Parts B through E are based on the Sensitivity Report in Excel that has been provided on the associated spreadsheet. You may also solve the Linear Program multiple times in order to verify your answers, but all justifications should be based on the Sensitivity Report. For Part F, please create a separate worksheet. Part B: What is the optimal production mix? Part C: Is there any unused production capacity? Page 9 of 12
10 Part D: Is this a unique optimum? Why? What other optimal solutions exist? Hint: Take a close look at the Sensitivity Report for the row BO. There are two different clues in that row that there are multiple optimal solutions. If there are alternate solutions, Excel will provide only one of them. You can trick Excel into providing another optimal solution by changing cost coefficients just a little (say by.01%) and resolving. Try this trick to get a 2 nd optimal solution. You do not need to submit a revised worksheet. Part E: Why is the shadow price of regular typesetting different from the shadow price of overtime typesetting? Hint: Notice that the shadow price for overtime typesetting is less than the shadow price for regular typesetting. In order to see why the prices are what they are first recall the (mathematical) definition of the shadow price. Then solve the problem with an additional unit of regular typesetting and see how the optimal solution changes. Then do the same for overtime typesetting. You do not need to submit a revised worksheet. Part F: If the printing firm has a chance to sell a new type of work that requires 0 hours of typesetting, 2 hours of camera, 2 hours of pressroom, and 2 hour of bindery, what contribution is required to make it attractive? Do this in two ways: (i) Price out (ii) Create a new worksheet and resolve (this worksheet should be submitted) Part G: Suppose that both the regular and overtime typesetting capacity are reduced by 4 hours. How does the optimal solution change? Part H: Let r denote the RHS value for regular typesetting. Let z(r) denote the optimal objective value when the RHS for regular typesetting is set to be r, and all other data is the same as given in problem 2. For example, z(50) = Find z(r) for all r from 0 to 100. Solve as few linear programs as you can. How many linear programs did you solve and what values of r did you test? Provide a sketch of z(r). How does z(r) behave between the break points provided in the sensitivity report? Page 10 of 12
11 Problem 6: A night at the Oscars (35 Points) This problem will help you explore the theoretical aspects of sensitivity analysis. Part A: Eddy Murphy, feeling upset over loosing best supporting actor, asks why in every sensitivity report the reduced costs are non-positive. Please explain. Part B: Jennifer Holiday after complaining about Jennifer Hudson, asks if it is always true that the negative reduced cost of a variable equals the allowable increase. Please explain. Part C: (3 points) After winning best Actress Helen Mirren asks the producers backstage if it is possible for a linear program constraint to have multiple shadow prices. Please explain and give an example. Part D: (5 points) The cast of babble is having trouble translating the lecture notes. Can you help them come up with a Linear Program with all equality constraints such that at least one constraint has a negative shadow price and one has a positive shadow price? Part E: Joan Rivers asks Clint Eastwood on the red carpet if we plot the cost coefficient vs. optimal z value for an objective for a max problem what type of property will the plot have. Part G: (Bonus 4 Points) Ellen counters a question by asking Barbra Walters to given an example of a linear program where a nonbasic variable objective function coefficient has to be improved by more than its REDUCED COST in order for it to enter the basis. Please come up with an example to help Barbra and explain why this sometimes occurs. Problem 7: Formulation (10 Points) The question challenges you to formulate an abstract LP from scratch. It is good practice for the exam. There are m refineries with the j-th refinery having the capacity to supply a i gallons of fuel. There are n cities with a demand for fuel. The demand for city i is b i gallons of fuel. When shipping fuel via train from refinery i to city j a fraction of the fuel shipped, f ij, is consumed by the track during transportation, Formulate a linear program to meet all fuel demands while minimizing the total fuel consumed. (HINT: if you are having trouble, first try making up date for a problem with two refineries and two cities. Your formulation for this made up Page 11 of 12
12 problem may help guide you to solving the abstract problem. However, there is no partial credit for handing in the formulation for the made up problem.) Challenge Problem D: (10 Points) Consider the following LP: Maximize z = 5x + y - 12v S.T 3x + 2y + v = 10 5x + 3y + w = 16 v, w, x, y, 0 An optimal solution to this problem is the vector (x, y, v, w) = (2, 2, 0, 0) and the corresponding simplex tableau is given by: z x y v w RHS Suppose in the original problem that we change the 3 coefficient of x to 3+ε. Determine the optimal profit as a function of ε, assuming the optimal basis matrix is not changed. To determine the optimum solution, you can assume that v = w = 0, and that x and y and z are functions of ε. Note that the functions of ε are not necessarily linear when we change a coefficient of the constraint matrix. Page 12 of 12
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 15.053 Optimization Methods in Management Science (Spring 2007) Problem Set 2 Due February 22 th, 2007 4:30pm in the Orange Box You will need 106 points out of 126
More informationEcon 172A - Slides from Lecture 9
1 Econ 172A - Slides from Lecture 9 Joel Sobel October 25, 2012 2 Announcements Important: Midterm seating assignments. Posted. Corrected Answers to Quiz 1 posted. Midterm on November 1, 2012. Problems
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing
More informationProblem Set 2 Geometry, Algebra, Reality
Problem Set 2 Geometry, Algebra, Reality Applied Mathematics 121 Spring 2011 Due 5:00 PM, Friday, February 11, 2011 Announcements The assignment is due by 5:00 PM, Friday, February 11, 2011. Readings:
More informationLinear Programming Problems
Linear Programming Problems Two common formulations of linear programming (LP) problems are: min Subject to: 1,,, 1,2,,;, max Subject to: 1,,, 1,2,,;, Linear Programming Problems The standard LP problem
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationLinear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.
University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall
More informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
More informationBCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.
Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method
More informationChapter II. Linear Programming
1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION
More informationEcon 172A - Slides from Lecture 8
1 Econ 172A - Slides from Lecture 8 Joel Sobel October 23, 2012 2 Announcements Important: Midterm seating assignments. Posted tonight. Corrected Answers to Quiz 1 posted. Quiz 2 on Thursday at end of
More informationTuesday, April 10. The Network Simplex Method for Solving the Minimum Cost Flow Problem
. Tuesday, April The Network Simplex Method for Solving the Minimum Cost Flow Problem Quotes of the day I think that I shall never see A poem lovely as a tree. -- Joyce Kilmer Knowing trees, I understand
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationCOLUMN GENERATION IN LINEAR PROGRAMMING
COLUMN GENERATION IN LINEAR PROGRAMMING EXAMPLE: THE CUTTING STOCK PROBLEM A certain material (e.g. lumber) is stocked in lengths of 9, 4, and 6 feet, with respective costs of $5, $9, and $. An order for
More informationDepartment of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):
Linköping University Optimization TAOP3(0) Department of Mathematics Examination Oleg Burdakov of 30 October 03 Assignment Consider the following linear programming problem (LP): max z = x + x s.t. x x
More informationResource Allocation (p. 254)
Linear Optimization 4.2 120 Resource Allocation (p. 254) Determine the linear program corresponding to the following problem. A farmer has set aside 18 acres of land to be used entirely for plots of grapes,
More informationRyerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003
Ryerson Polytechnic University Department of Mathematics, Physics, and Computer Science Final Examinations, April, 2003 MTH 503 - Operations Research I Duration: 3 Hours. Aids allowed: Two sheets of notes
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationI will illustrate the concepts using the example below.
Linear Programming Notes More Tutorials at www.littledumbdoctor.com Linear Programming Notes I will illustrate the concepts using the example below. A farmer plants two crops, oats and corn, on 100 acres.
More informationEaster Term OPTIMIZATION
DPK OPTIMIZATION Easter Term Example Sheet It is recommended that you attempt about the first half of this sheet for your first supervision and the remainder for your second supervision An additional example
More informationPart 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm
In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.
More informationMULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM2046 ENGINEERING MATHEMATICS IV TUTORIAL
A. Linear Programming (LP) MULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM046 ENGINEERING MATHEMATICS IV TUTORIAL. Identify the optimal solution and value: (a) Maximize f = 0x + 0 x (b) Minimize f = 45x
More informationLinear programming II João Carlos Lourenço
Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,
More informationThe Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014
The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014 Name TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1)
More informationSection Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018
Section Notes 4 Duality, Sensitivity, and the Dual Simplex Algorithm Applied Math / Engineering Sciences 121 Week of October 8, 2018 Goals for the week understand the relationship between primal and dual
More information4. Linear Programming
/9/08 Systems Analysis in Construction CB 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. Linear Programming Optimization Network Models -
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationGraphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved.
Graphical Analysis For problems with 2 variables, we can represent each solution as a point in the plane. The Shelby Shelving model (see the readings book or pp.68-69 of the text) is repeated below for
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationCASE STUDY. fourteen. Animating The Simplex Method. case study OVERVIEW. Application Overview and Model Development.
CASE STUDY fourteen Animating The Simplex Method case study OVERVIEW CS14.1 CS14.2 CS14.3 CS14.4 CS14.5 CS14.6 CS14.7 Application Overview and Model Development Worksheets User Interface Procedures Re-solve
More informationTRANSPORTATION AND ASSIGNMENT PROBLEMS
TRANSPORTATION AND ASSIGNMENT PROBLEMS Transportation problem Example P&T Company produces canned peas. Peas are prepared at three canneries (Bellingham, Eugene and Albert Lea). Shipped by truck to four
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationMA30SA Applied Math Unit D - Linear Programming Revd:
1 Introduction to Linear Programming MA30SA Applied Math Unit D - Linear Programming Revd: 120051212 1. Linear programming is a very important skill. It is a brilliant method for establishing optimum solutions
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.
Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide
More information56:171 Operations Research Homework #5 Solution Fall 2002
SOLTION. Consider the transportation tableau: 56:7 Operations Research Homework #5 Solution Fall 00 dstn source 5 Supply 8 9 5 9 B 0 7 C 9 7 8 D 7 8 9 0 9 0 Demand= 7 5 5 9 a. se the initial basic solution:
More informationOutline. CS38 Introduction to Algorithms. Linear programming 5/21/2014. Linear programming. Lecture 15 May 20, 2014
5/2/24 Outline CS38 Introduction to Algorithms Lecture 5 May 2, 24 Linear programming simplex algorithm LP duality ellipsoid algorithm * slides from Kevin Wayne May 2, 24 CS38 Lecture 5 May 2, 24 CS38
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 - 05 Lecture - 24 Solving LPs with mixed type of constraints In the
More informationII. Linear Programming
II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative
More informationDesign and Analysis of Algorithms (V)
Design and Analysis of Algorithms (V) An Introduction to Linear Programming Guoqiang Li School of Software, Shanghai Jiao Tong University Homework Assignment 2 is announced! (deadline Apr. 10) Linear Programming
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationIntroduction. Chapter 15. Optimization Modeling: Applications. Integer Programming. Manufacturing Example. Three Types of ILP Models
Chapter 5 Optimization Modeling: Applications Integer Programming Introduction When one or more variables in an LP problem must assume an integer value we have an Integer Linear Programming (ILP) problem.
More informationCSE 40/60236 Sam Bailey
CSE 40/60236 Sam Bailey Solution: any point in the variable space (both feasible and infeasible) Cornerpoint solution: anywhere two or more constraints intersect; could be feasible or infeasible Feasible
More informationAM 121: Intro to Optimization Models and Methods Fall 2017
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries
More informationArtificial Intelligence
Artificial Intelligence Combinatorial Optimization G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/34 Outline 1 Motivation 2 Geometric resolution
More informationA Survey of Software Packages for Teaching Linear and Integer Programming
A Survey of Software Packages for Teaching Linear and Integer Programming By Sergio Toledo Spring 2018 In Partial Fulfillment of Math (or Stat) 4395-Senior Project Department of Mathematics and Statistics
More informationCSE 460. Today we will look at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm"
CSE 460 Linear Programming" Today we will look at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm" Classes of Optimization Problems" Optimization" unconstrained"..." linear"
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)
More informationChapter 7. Linear Programming Models: Graphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian
More information3. Decision variables are represented in both the objective function and the constraints while formulating a linear program.
Supplement E Supplement E Linear Programming Linear Programming TRUE/FALSE 1. Linear programming is useful for allocating scarce resources among competing demands. Answer: True Reference: Introduction
More informationChapter 4 Linear Programming
Chapter Objectives Check off these skills when you feel that you have mastered them. From its associated chart, write the constraints of a linear programming problem as linear inequalities. List two implied
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer
More information3.1 Graphing Linear Inequalities
3.1 Graphing Linear Inequalities I. Inequalities A. Introduction Many mathematical descriptions of real situations are best expressed as inequalities rather than equations. For example, a firm might be
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationName: THE SIMPLEX METHOD: STANDARD MAXIMIZATION PROBLEMS
Name: THE SIMPLEX METHOD: STANDARD MAXIMIZATION PROBLEMS A linear programming problem consists of a linear objective function to be maximized or minimized subject to certain constraints in the form of
More informationLesson 08 Linear Programming
Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications
More informationCSC 8301 Design & Analysis of Algorithms: Linear Programming
CSC 8301 Design & Analysis of Algorithms: Linear Programming Professor Henry Carter Fall 2016 Iterative Improvement Start with a feasible solution Improve some part of the solution Repeat until the solution
More informationFarming Example. Lecture 22. Solving a Linear Program. withthe Simplex Algorithm and with Excel s Solver
Lecture 22 Solving a Linear Program withthe Simplex Algorithm and with Excel s Solver m j winter, 2 Farming Example Constraints: acreage: x + y < money: x + 7y < 6 time: x + y < 3 y x + y = B (, 8.7) x
More informationME 391Q Network Flow Programming
ME 9Q Network Flow Programming Final Exam, Summer 00. ( Points) The figure below shows an undirected network. The parameters on the edges are the edge lengths. Find the shortest path tree using Dijkstra
More informationChapter 4: The Mechanics of the Simplex Method
Chapter 4: The Mechanics of the Simplex Method The simplex method is a remarkably simple and elegant algorithmic engine for solving linear programs. In this chapter we will examine the internal mechanics
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationCDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH. Unit : I - V
CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH Unit : I - V UNIT I Introduction Operations Research Meaning and definition. Origin and History Characteristics and Scope Techniques in Operations
More informationSEN301 OPERATIONS RESEARCH I PREVIUOS EXAM QUESTIONS
SEN30 OPERATIONS RESEARCH I PREVIUOS EXAM QUESTIONS. A company is involved in the production of two items (X and Y). The resources need to produce X and Y are twofold, namely machine time for automatic
More informationLinear Programming: Model Formulation and Graphical Solution
Linear Programming: Model Formulation and Graphical Solution Chapter 2 2-1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationCSCI 5654 (Fall 2013): Network Simplex Algorithm for Transshipment Problems.
CSCI 5654 (Fall 21): Network Simplex Algorithm for Transshipment Problems. Sriram Sankaranarayanan November 14, 21 1 Introduction e will present the basic ideas behind the network Simplex algorithm for
More informationThese definitions are only useful within the graphical solution of LP models. Thus, a more general definition is required.
BUAD 403 OPERATIONAL RESEARCH I LECTURE IV HAND OUT Binding Constraints & Non-Binding Constraints: Binding Constraints: are the constraints that intersect on the optimum solution point. Non-Binding Constraints:
More informationCivil Engineering Systems Analysis Lecture XIV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XIV Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Dual 2 Linear Programming Dual Problem 3
More informationLinear Programming: Model Formulation and Graphical Solution
Linear Programming: Model Formulation and Graphical Solution Chapter 2 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model
More informationEcon 172A - Slides from Lecture 2
Econ 205 Sobel Econ 172A - Slides from Lecture 2 Joel Sobel September 28, 2010 Announcements 1. Sections this evening (Peterson 110, 8-9 or 9-10). 2. Podcasts available when I remember to use microphone.
More informationMath Introduction to Operations Research
Math 300 Introduction to Operations Research Examination (50 points total) Solutions. (6 pt total) Consider the following linear programming problem: Maximize subject to and x, x, x 3 0. 3x + x + 5x 3
More informationRead: H&L chapters 1-6
Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research Fall 2006 (Oct 16): Midterm Review http://www-scf.usc.edu/~ise330
More informationPrepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.
Prepared By Handaru Jati, Ph.D Universitas Negeri Yogyakarta handaru@uny.ac.id Chapter 8 Using The Excel Solver To Solve Mathematical Programs Chapter Overview 8.1 Introduction 8.2 Formulating Mathematical
More informationUsing the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood
PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8719-E October 1998 $2.50 Using the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood A key problem faced by managers is how to
More informationSolving Linear Programs Using the Simplex Method (Manual)
Solving Linear Programs Using the Simplex Method (Manual) GáborRétvári E-mail: retvari@tmit.bme.hu The GNU Octave Simplex Solver Implementation As part of the course material two simple GNU Octave/MATLAB
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 16: Mathematical Programming I Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 8, 2010 E. Frazzoli
More informationFriday 5 June 2015 Morning
Oxford Cambridge and RSA Friday 5 June 2015 Morning AS GCE MATHEMATICS 4736/01 Decision Mathematics 1 QUESTION PAPER * 3 2 4 8 7 7 8 5 4 8 * Candidates answer on the Printed Answer Book. OCR supplied materials:
More informationLecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)
Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport
More informationChapter 1 Linear Programming. Paragraph 4 The Simplex Algorithm
Chapter Linear Programming Paragraph 4 The Simplex Algorithm What we did so far By combining ideas of a specialized algorithm with a geometrical view on the problem, we developed an algorithm idea: Find
More informationChapter 2 - An Introduction to Linear Programming
True / False 1. Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution. TOPICS: Introduction 2. In a linear programming problem, the objective function
More informationLinear Programming Terminology
Linear Programming Terminology The carpenter problem is an example of a linear program. T and B (the number of tables and bookcases to produce weekly) are decision variables. The profit function is an
More informationGiapetto s Woodcarving Problem
MTE 503-1 Computer Technology in Mathematics Education TI Worksheet Ezgi ÇALLI Class level: 9-10 Objectives: IGCSE (0607-Extended, 2014): (Extension to) 7.7. Linear inequalities on the Cartesian plane
More informationGraphs that have the feasible bases of a given linear
Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700
More informationChapter 2 An Introduction to Linear Programming
Chapter 2 An Introduction to Linear Programming MULTIPLE CHOICE 1. The maximization or minimization of a quantity is the a. goal of management science. b. decision for decision analysis. c. constraint
More informationIntroduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 9 Integer Programming. Chapter 9 - Integer Programming 1
Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 9 Integer Programming Chapter 9 - Integer Programming 1 Chapter Topics Integer Programming (IP) Models Still linear programming
More informationINEN 420 Final Review
INEN 420 Final Review Office Hours: Mon, May 2 -- 2:00-3:00 p.m. Tues, May 3 -- 12:45-2:00 p.m. (Project Report/Critiques due on Thurs, May 5 by 5:00 p.m.) Tuesday, April 28, 2005 1 Final Exam: Wednesday,
More informationCh.02 Modeling with Linear Programming. Management Science / Instructor: Bonghyun Ahn
Ch.02 Modeling with Linear Programming Management Science / Instructor: Bonghyun Ahn Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization
More informationWhat s Linear Programming? Often your try is to maximize or minimize an objective within given constraints
Linear Programming What s Linear Programming? Often your try is to maximize or minimize an objective within given constraints A linear programming problem can be expressed as a linear function of certain
More informationLesson 17. Geometry and Algebra of Corner Points
SA305 Linear Programming Spring 2016 Asst. Prof. Nelson Uhan 0 Warm up Lesson 17. Geometry and Algebra of Corner Points Example 1. Consider the system of equations 3 + 7x 3 = 17 + 5 = 1 2 + 11x 3 = 24
More informationJournal of Business & Economics Research November, 2009 Volume 7, Number 11
Alternate Solutions Analysis For Transportation Problems Veena Adlakha, University of Baltimore, USA Krzysztof Kowalski, Connecticut Department of Transportation, USA ABSTRACT The constraint structure
More informationMLR Institute of Technology
Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective
More informationUsing the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood
PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8720-E October 1998 $3.00 Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood A key problem faced
More information