Written Exam Linear and Integer Programming (DM545)
|
|
- Beverley Randall
- 5 years ago
- Views:
Transcription
1 Written Exam Linear and Integer Programming (DM545) Department of Mathematics and Computer Science University of Southern Denmark Monday, June 22, 2015, 10:00 14:00, Festsalen, Niels Bohr Allé 1 The exam consists of a number of tasks divided into subtasks. The answers in a PDF document are to be handed in electronically in Blackboard ( The content of the documents Eksamensvejledning and Exam Monitor published in BlackBoard under the section Course Information is assumed to be known. Remember to justify all your statements! You may refer to results from the books or the lecture slides listed at the course web page. In particular, it is possible to justify a statement by saying that it derives trivially from a result in the textbook (if this is true). You may use all methods or extensions that have been used in the assignment sheets, published during the course. However, it is not allowed to answer a subtask exclusively by reference to an exercise seen during the course. Reference to other books (outside the course material) or to internet links is not accepted as answer to a task. The contribution to the final evaluation of each task, if carried out correctly, is given at the beginning of each task as a list of points for each subtask. The number of points does not necessarily reflect the difficulty of the subtask. The maximum score is 100. Exercises are sorted in the order of treatment during the course. The exam consists of 7 tasks distributed on 15 pages. You may write your answers in Danish or in English. An HTML version of this document with some data in different format is available at: However, the printed copy and the PDF file are the official reference for the exam.
2 Contents Simplex (points: 8, 12, 5, 10) Revised Simplex (points: 10, 3) Duality (points: 11) 6 LP Formulation (points: 5, 5, 3) Branch and bound (points: 10, 6) IP Formulation (points: 12) 12 Network Flows (points: 5) 14 Page 2 of 15
3 Task 1 Simplex (points: 8, 12, 5, 10) Consider the following integer linear programming problem: x 2 (IP ) max z = 2x 1 + x 2 s.t. 5x x x 1 2x 2 1 x 1 + 3x x 2 2 x 1 0 x 1, x 2 integer x 1 and let (LR0) be the linear relaxation of (IP). [Note: in the following subtasks, arguments that refer to the graphical representation given above will NOT be counted as valid. You can use Python to do the calculations. A tutorial on the commands you may need is available from the course web page under Assessment. For rational numbers, please, use fraction mode representation. ] Subtask 1.a Write the initial tableau for (LR0) and the corresponding basic solution. solution feasible? Is the basic Subtask 1.b After a number of simplex iterations the tableau of (LR0) looks as follows: x1 x2 x3 x4 x5 x6 -z b 5/ / /3 11/ / /3 1/ / /3-1/ / /3 5/ / /3 Perform from here another simplex iteration using the largest increase pivoting rule. [The Python code for the tableau above is given in the HTML version of this document.] Page 3 of 15
4 Subtask 1.c After two more simplex iterations we reach the following optimal tableau for (LR0): x1 x2 x3 x4 x5 x6 -z b 1 0 1/20 1/ / /40 1/ / /40-1/ / /40-1/ / /40-3/ /4 Write: (i) an explanation of why this tableau is optimal. (ii) the corresponding optimal solution and its value. (iii) what type of information the solution value of (LR0) provides for the solution value of (IP). (iv) the branching constraint for the variable of (IP) that has the most fractional value in the optimal solution of (LR0). Subtask 1.d Let s now branch on the variable x 2 : x 2 7/4 x 2 7/4 and let s consider the up branch, that is, x 2 7/4. Add this constraint to (LR0), thus obtaining the new problem (LR1). Find the optimal solution of (LR1) by introducing the new constraint in the optimal tableau of (LR0) 1 and performing one single further simplex iteration. Report the optimal solution of (LR1). Can we say that this solution is the optimal solution also for the original problem (IP) without doing any further computation? Why? 1 You are given this optimal tableau in Subtask 1.c. Page 4 of 15
5 Task 2 Revised Simplex (points: 10, 3) Consider the following LP problem maximize x x x x x 5 st x x x x x x x 2 3 x 3 2 x 4 0 x 1, x 2, x 3, x 4, x 5 0 and call x 6, x 7 the two slack variables to bring the problem in standard form. [Use Python to carry out the calculations. Here, there is no requirement to use the fraction mode. You find online the data above in Python format.] Subtask 2.a In the optimal simplex tableau the basic variables are x B = (x 3, x 5 ) and the non basic variables are x N = (x 1, x 2, x 4, x 6, x 7 ). Using only matrix computations, like in the revised simplex method, determine the value of the variables (x 1, x 2, x 3, x 4, x 5 ) and the value of the two dual variables associated with the two constraints. Subtask 2.b Knowing that (x 5, x 7 ) and (x 3, x 5 ) are also optimal bases and that all three optimal bases give the same optimal solution, what can you conclude about the state of the simplex tableau? Page 5 of 15
6 Task 3 Duality (points: 11) Write the dual of the following pooling problem that we defined in Exam 2014 on a set of source nodes I, indexed by i and a set of pools J, index by j: (P ) max r j x ij j J i I x ij b i j J x ij d j i I p i x ij = p j i I i I x ij 0 x ij i I j J j J i I, j J If you find it helpful, you can use the numerical example depicted in Figure 1. However, the dual problem must be expressed in general terms as in the model above dkk 20% 10 40% G dkk 16% 20 0% T dkk 13% dkk 10% Figure 1: A numerical example for the pooling problem of Task 3. Page 6 of 15
7 Task 4 LP Formulation (points: 5, 5, 3) Consider the world s currency market. Given two currencies, say the British Pound GBP and the Euro, there is an exchange rate between them (currently about 0.72 Pounds to the Euro). It is often true that, if you convert money from one currency to another and then back, you will end up with less than you started with. That is, the product of the exchange rates between the two countries is less than one. However, it sometimes happens that a longer chain of conversions results in a gain. Such a lucky situation is called a currency arbitrage. One can use a linear programming model to find such situations when they suddenly arise. Consider the following table of exchange rates (which are actual data): rate = { ( USD, YEN ) : , ( YEN, USD ) : 0.008, ( USD, GBP ) : 0.646, ( GBP, USD ) : 1.548, ( USD, EUR ) : 0.885, ( EUR, USD ) : 1.13, ( EUR, GBP ) : 0.72, ( GBP, EUR ) : 1.39, ( EUR, YEN ) : , ( YEN, EUR ) : 0.007, ( GBP, YEN ) : , ( YEN, GBP ) : } It is not obvious, but the EUR USD GBP EUR conversion actually generates 1 euro if we let circulate 68 euro, i.e., it is a money pump. To look for arbitrage possibilities, one can make a generalized network model, which is a network flow model with the unusual feature that a unit of flow that leaves one node arrives at the next node multiplied by a scale factor in our case, the currency conversion rate. For us, each currency is represented by a node. There is an arc from each node to every other node. A flow of one unit out of one node becomes a flow of a different magnitude at the head node. For example, one dollar flowing out of the USD node arrives at the YEN node as YEN. Let x ij denote the flow from node (i.e. currency) i to node j. This flow is measured in the currency of node i. One node is special; it is the home node, say the Euro (EUR) node. At this node there can be a flow imbalance. At all other nodes, there must be flow balance. [The following three tasks must be solved sequentially. Hence, if you cannot do one, skip the successive ones and focus on another Task.] Subtask 4.a Write a linear programming problem in explicit form 2 for the specific example and data described above. More specifically: 2 An explicit form is here intended to use scalars and specific data and does not use summations, vectors and matrices. Page 7 of 15
8 Write the flow balance constraints at one of the 3 non-home nodes (YEN, USD and GBP). At the home node (EUR), the flow balance will not be satisfied. Instead one expects a net in or out flow. If it is possible to make this net flow outgoing, then an arbitrage has been found. Let f be a variable that represents the outflow. Using variable f to represent net outflow to the home node, write a flow balance equation for the home node. Write an objective function to find the best arbitrage, ie, chain of conversions. To avoid unboundedness limit f to be smaller or equal to 1. Subtask 4.b Now consider the general case, which might involve hundreds of currencies worldwide. Write the model mathematically using x ij for the flow leaving node i heading for node j (measured in the currency of node i), r ij for the exchange rate when converting from currency i to currency j, and f for the net outflow at the home node h. Subtask 4.c Is the constraint matrix totally unimodular? Can your model give a fractional flow x? Page 8 of 15
9 Task 5 Branch and bound (points: 10, 6) Consider the following knapsack problem: Subtask 5.a max 42x x x x x 4 s.t. 88x x x x x 4 92 x 0, x 1, x 2, x 3, x 4 binary We solve the problem by branch and bound. In Table 1 we report the solution values of the linear programming relaxations computed at some initial nodes. After each computation, you have to provide the missing information here listed: (a) The value of the best global 3 dual bound up to that point (take possible roundings into account). The initial value is +. (b) The value of the best global primal bound up to that point. The initial value is. (c) The list of open nodes left and, if some nodes have been pruned, an indication about the type of pruning used (i.e., by optimality, by infeasibility, by bounding). (d) Whether we can stop because we solved the problem or whether we must continue examining open nodes or branching. If we solved the problem say which is the solution type (infeasible/unbounded) or the solution value. You have to report this information after each row of the Table 1. The branch and bound tree represented on the right column is obtained after the solution of the linear relaxation at the node. Nodes filled with grey are nodes that have been already processed while nodes in white have not yet been processed. The list of open nodes will be made by the white nodes that you decide not to prune. [Note, running a solver will not help you to solve this task.] Subtask 5.b We solve the problem by branch and bound. The first two levels of the branch and bound tree are reported in Figure 2. We solve first the linear relaxation at the root node and then the one at the node N3. The solution found at node N3 is: x N3 LR = [0; 0.5; 1; 0; 1] and has value Find a valid cover inequality that is violated by this solution and say whether it would be valid globally, for example, also at the node N2 and N6. 3 A global dual/primal bound is one that is valid a the root node given the information collected on the subtrees. Page 9 of 15
10 Node N1: Simplex report: x 2 0 N1 x 2 1 starting value = Finished solving (status=optimal, iters=2, leave=2, enter=0, objvalue= ) fractional variables = 1 x 0 0 N6 N2 x 0 1 N7 x 1 0 N4 N3 x 1 1 N5 Node N3: Simplex report: x 2 0 N1 x 2 1 starting value = finished solving (status=optimal, iters=2, leave=2, enter=0, objvalue= ) fractional variables = 1 x 0 0 N6 N2 x 0 1 N7 x 1 0 N4 N3 x 1 1 N5 Node N2: Simplex report: x 2 0 N1 x 2 1 starting value = Finished solving (status=optimal, iters=1, leave=1, enter=0, objvalue= ) fractional variables = 1 x 0 0 N6 N2 x 0 1 N7 x 1 0 N4 N3 x 1 1 N5 Node N6: Simplex report: x 2 0 N1 x 2 1 starting value = Finished solving (status=optimal, iters=1, leave=1, enter=0, objvalue= ) fractional variables = 0 x 0 0 N6 N2 x 0 1 N7 x 1 0 N4 N3 x 1 1 N5 Node N7: Simplex report: x 2 0 N1 x 2 1 starting value = Finished solving (status=infeasible, objvalue=--) x 0 0 N2 x 0 1 x 1 0 N3 x 1 1 N6 N7 N4 N5 Table 1: The results of linear relaxations at some nodes of the branch and bound tree. Page 10 of 15
11 N1 x 2 0 x 2 1 N2 N3 x 0 0 x 0 1 x 1 0 x 1 1 N6 N7 N4 N5 Figure 2: The first two levels of the branch and bound tree of Subtask 5.b. Page 11 of 15
12 Task 6 IP Formulation (points: 12) The following decision problem arises in the organization of the course FF501, First Year Project, at the Faculty of Science. After the assignment of students to projects, the students must be assigned to sections (in Danish, hold) of a set of minicourses and the sections must be scheduled in one of the available timeslots. Minicourses are workshops on topics complementary to the projects, for example, on Latex, on scientific writing, etc. Each minicourse is offered a number of times, each times to a different set of students called section (or hold, in Danish). We make the simplifying assumption that students are enrolled to all minicourses available. Moreover, since students assigned in groups to the same project are to be assigned to the same section, we focus on groups rather than on students. We use the following notation: G, indexed by g, is the set of groups; n g is the number of students in group g G; C, indexed by c, is the set of minicourses; H c, indexed by h, is the set of sections for minicourse c C. For two different minicourses c 1, c 2 the sets H c1, H c2 are different and may contain a different number of sections; T, indexed by t, is the set of timeslots (they can be thought of as tuples (day, hour, week)). We will assume that no pair of different timeslots, t 1, t 2 T, overlap; n c is the average number of students in sections of a minicourse c C. This number is obtained by dividing the total number of students that are enrolled in the minicourse by the number of sections in the minicourse, ie, H c. It represents the desired size of the section. Your task is to write a mixed integer linear programming problem to model the assignment of students to sections and sections to timeslots. Your model must express the following constraints: (i) each group must attend exactly one section of each minicourse (ii) each section must be scheduled in a timeslot (iii) there cannot be two sections of the same minicourse that are scheduled in the same timeslot (iv) if two sections of different minicourses share groups, then they cannot be scheduled at the same time. Page 12 of 15
13 The objective is to balance the distribution of students in the sections by minimizing the sum of the absolute deviations of the number of students assigned to the sections from their desired size, that is, n c for all sections of course c C. [Hint: introduce binary variables x gch and y cht to represent the assignment of groups to sections and of sections to timeslots.] Page 13 of 15
14 Task 7 Network Flows (points: 5) This task was not included in the written exam of June 22 but it is included for the oral reexam. Maximum flow problems in networks can be solved by linear programming or, more efficiently, by dedicated algorithms. In the module networkx for Python the function maximum_flow solves the maximum flow problem using one of these efficient algorithms, that can be selected with the option flow_func. In Figure 3 you are given an example of a Python script that uses maximum_flow for finding the maximum flow for the Network depicted on the right side. In this particular example the algorithm by Ford and Fulkerson is selected that solves the problem in O(nm 2 ) for n nodes and m arcs. #!/usr/bin/env python import networkx as nx t print "Networkx versions is",nx. version G = nx.digraph() G.add_edge( s, a, capacity=3.0) G.add_edge( s, b, capacity=1.0) G.add_edge( a, c, capacity=3.0) G.add_edge( b, c, capacity=5.0) G.add_edge( b, d, capacity=4.0) G.add_edge( d, e, capacity=2.0) G.add_edge( c, t, capacity=2.0) G.add_edge( e, t, capacity=3.0) flow_value, flow_dict = nx.maximum_flow(g, s, t, flow_func=nx.algorithms.flow.ford_fulkerson) print flow_value, flow_dict e b 4.0 d s c 3.0 a Figure 3: An example of Python code to find the maximum (s, t) flow in the network depicted on the right. Remember that a max flow problem is always defined in a network N = (V, A, l 0, u), that is, a network where on arcs there are only capacities and no lower bounds. All nodes except the source and the target have then null balance. Source and target have infinite balances. In this task, you have to find a feasible flow for the network N = (V, A, l, u ) represented in Figure 4 by solving a maximum flow problem. More specifically, you have to: (i) explain how you can use a maximum flow algorithm for a network N for solving the feasible flow problem for the network N ; (ii) report the script with the correct data for solving the feasible flow problem on the network N ; Page 14 of 15
15 (iii) execute the script and, if a feasible flow for the Network of Figure 4 is found, report the flow for this network. (If you do not have networkx installed then make sure that your code is correct both in the data content and in syntax such that it can be run by the examiner by copy and paste.) [Note that an answer to this task by guessing a solution without reporting the precise source code will not count as valid.] 1//2 b/ 5 c/2 d/4 3//4 3//4 3//4 2//2 2//4 0//1 a/ 1 a/-1, b/-5, c/2, d/4, e/0 a/c/{3/ /4}, a/d/{2/ /2}, b/c/{1/ /2}, b/e/{3/ /4}, c/a/{3/ /4}, e/a/{0/ /1}, e/d/{2/ /4} e/0 Figure 4: The network with the data. For the nodes the notation l/b indicates the that label of the node is l and the balance b. For the arcs the notation e 1 /e 2 /{l//u} indicates that the tail of the arc is e 1, the head e 2, the lower bound l and the upper bound u (The Tikz file for the network is available in the online HTML version of this document.) Page 15 of 15
Written Exam Linear and Integer Programming (DM554)
Written Exam Linear and Integer Programming (DM554) Department of Mathematics and Computer Science University of Southern Denmark Monday, June 22, 2015, 10:00 14:00, Festsalen, Niels Bohr Allé 1 The exam
More informationmaxz = 3x 1 +4x 2 2x 1 +x 2 6 2x 1 +3x 2 9 x 1,x 2
ex-5.-5. Foundations of Operations Research Prof. E. Amaldi 5. Branch-and-Bound Given the integer linear program maxz = x +x x +x 6 x +x 9 x,x integer solve it via the Branch-and-Bound method (solving
More informationmin3x 1 + 4x 2 + 5x 3 2x 1 + 2x 2 + x 3 6 x 1 + 2x 2 + 3x 3 5 x 1, x 2, x 3 0.
ex-.-. Foundations of Operations Research Prof. E. Amaldi. Dual simplex algorithm Given the linear program minx + x + x x + x + x 6 x + x + x x, x, x. solve it via the dual simplex algorithm. Describe
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More information(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider
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 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 informationOptimization - Examples Sheet 1
Easter 0 YMS Optimization - Examples Sheet. Show how to solve the problem min n i= (a i + x i ) subject to where a i > 0, i =,..., n and b > 0. n x i = b, i= x i 0 (i =,...,n). Minimize each of the following
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 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 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 informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense April, 208 Marco Chiarandini DM559/DM545 Linear and integer programming Sheet 3, Spring 208 [pdf format] Included.
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 informationWeek 4. (1) 0 f ij u ij.
Week 4 1 Network Flow Chapter 7 of the book is about optimisation problems on networks. Section 7.1 gives a quick introduction to the definitions of graph theory. In fact I hope these are already known
More 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 informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationc) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns
BUILDING A SIMPLEX TABLEAU AND PROPER PIVOT SELECTION Maximize : 15x + 25y + 18 z s. t. 2x+ 3y+ 4z 60 4x+ 4y+ 2z 100 8x+ 5y 80 x 0, y 0, z 0 a) Build Equations out of each of the constraints above by introducing
More 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 informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More informationDiscrete Optimization
Prof. Friedrich Eisenbrand Martin Niemeier Due Date: April 15, 2010 Discussions: March 25, April 01 Discrete Optimization Spring 2010 s 3 You can hand in written solutions for up to two of the exercises
More informationLinear Programming Redux
Linear Programming Redux Jim Bremer May 12, 2008 The purpose of these notes is to review the basics of linear programming and the simplex method in a clear, concise, and comprehensive way. The book contains
More informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
More 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 informationOverview of course. Introduction to Optimization, DIKU Monday 12 November David Pisinger
Introduction to Optimization, DIKU 007-08 Monday November David Pisinger Lecture What is OR, linear models, standard form, slack form, simplex repetition, graphical interpretation, extreme points, basic
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 informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More informationIntroduction to the Simplex Algorithm Active Learning Module 3
Introduction to the Simplex Algorithm Active Learning Module 3 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Background Material Almost any
More informationIntroduction to integer programming II
Introduction to integer programming II Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects of Optimization
More informationDecision Models Lecture 5 1. Lecture 5. Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class
Decision Models Lecture 5 1 Lecture 5 Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class Foreign Exchange (FX) Markets Decision Models Lecture 5
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 informationAlgorithms Exam TIN093 /DIT602
Algorithms Exam TIN093 /DIT602 Course: Algorithms Course code: TIN 093, TIN 092 (CTH), DIT 602 (GU) Date, time: 21st October 2017, 14:00 18:00 Building: SBM Responsible teacher: Peter Damaschke, Tel. 5405
More informationLecture 5. x 1,x 2,x 3 0 (1)
Computational Intractability Revised 2011/6/6 Lecture 5 Professor: David Avis Scribe:Ma Jiangbo, Atsuki Nagao 1 Duality The purpose of this lecture is to introduce duality, which is an important concept
More informationSOLVING INTEGER LINEAR PROGRAMS. 1. Solving the LP relaxation. 2. How to deal with fractional solutions?
SOLVING INTEGER LINEAR PROGRAMS 1. Solving the LP relaxation. 2. How to deal with fractional solutions? Integer Linear Program: Example max x 1 2x 2 0.5x 3 0.2x 4 x 5 +0.6x 6 s.t. x 1 +2x 2 1 x 1 + x 2
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 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 informationInteger Programming. The focus of this chapter is on solution techniques for integer programming models.
Integer Programming Introduction The general linear programming model depends on the assumption of divisibility. In other words, the decision variables are allowed to take non-negative integer as well
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 informationMATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00
MATH 373 Section A1 Final Exam Dr. J. Bowman 17 December 2018 14:00 17:00 Name (Last, First): Student ID: Email: @ualberta.ca Scrap paper is supplied. No notes or books are permitted. All electronic equipment,
More informationLecture 23 Branch-and-Bound Algorithm. November 3, 2009
Branch-and-Bound Algorithm November 3, 2009 Outline Lecture 23 Modeling aspect: Either-Or requirement Special ILPs: Totally unimodular matrices Branch-and-Bound Algorithm Underlying idea Terminology Formal
More informationResource Constrained Project Scheduling Linear and Integer Programming (1)
DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern
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 informationMath 16 - Practice Final
Math 16 - Practice Final May 28th 2007 Name: Instructions 1. In Part A, attempt every question. In Part B, attempt two of the five questions. If you attempt more you will only receive credit for your best
More informationLecture 11 Linear programming : The Revised Simplex Method
Lecture 11 Linear programming : The Revised Simplex Method 11.1 The Revised Simplex Method While solving linear programming problem on a digital computer by regular simplex method, it requires storing
More informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
More informationSensitivity Analysis
Dr. Maddah ENMG 500 /9/07 Sensitivity Analysis Changes in the RHS (b) Consider an optimal LP solution. Suppose that the original RHS (b) is changed from b 0 to b new. In the following, we study the affect
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
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 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 informationLecture 11: Post-Optimal Analysis. September 23, 2009
Lecture : Post-Optimal Analysis September 23, 2009 Today Lecture Dual-Simplex Algorithm Post-Optimal Analysis Chapters 4.4 and 4.5. IE 30/GE 330 Lecture Dual Simplex Method The dual simplex method will
More informationLecture 5 January 16, 2013
UBC CPSC 536N: Sparse Approximations Winter 2013 Prof. Nick Harvey Lecture 5 January 16, 2013 Scribe: Samira Samadi 1 Combinatorial IPs 1.1 Mathematical programs { min c Linear Program (LP): T x s.t. a
More informationComputational Integer Programming Universidad de los Andes. Lecture 1. Dr. Ted Ralphs
Computational Integer Programming Universidad de los Andes Lecture 1 Dr. Ted Ralphs MIP Lecture 1 1 Quick Introduction Bio Course web site Course structure http://coral.ie.lehigh.edu/ ted/teaching/mip
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 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 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 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 informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationAM 121: Intro to Optimization Models and Methods
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 2: Intro to LP, Linear algebra review. Yiling Chen SEAS Lecture 2: Lesson Plan What is an LP? Graphical and algebraic correspondence Problems
More 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 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 informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
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 - 3 Simplex Method for Bounded Variables We discuss the simplex algorithm
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 informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More informationChap6 Duality Theory and Sensitivity Analysis
Chap6 Duality Theory and Sensitivity Analysis The rationale of duality theory Max 4x 1 + x 2 + 5x 3 + 3x 4 S.T. x 1 x 2 x 3 + 3x 4 1 5x 1 + x 2 + 3x 3 + 8x 4 55 x 1 + 2x 2 + 3x 3 5x 4 3 x 1 ~x 4 0 If we
More informationLinear Programming: Chapter 5 Duality
Linear Programming: Chapter 5 Duality Robert J. Vanderbei September 30, 2010 Slides last edited on October 5, 2010 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544
More 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 informationFoundations of Operations Research
Solved exercises for the course of Foundations of Operations Research Roberto Cordone The dual simplex method Given the following LP problem: maxz = 5x 1 +8x 2 x 1 +x 2 6 5x 1 +9x 2 45 x 1,x 2 0 1. solve
More 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 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 informationCOMP3121/9101/3821/9801 Lecture Notes. Linear Programming
COMP3121/9101/3821/9801 Lecture Notes Linear Programming LiC: Aleks Ignjatovic THE UNIVERSITY OF NEW SOUTH WALES School of Computer Science and Engineering The University of New South Wales Sydney 2052,
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 informationDecember 2014 MATH 340 Name Page 2 of 10 pages
December 2014 MATH 340 Name Page 2 of 10 pages Marks [8] 1. Find the value of Alice announces a pure strategy and Betty announces a pure strategy for the matrix game [ ] 1 4 A =. 5 2 Find the value of
More informationWorked Examples for Chapter 5
Worked Examples for Chapter 5 Example for Section 5.2 Construct the primal-dual table and the dual problem for the following linear programming model fitting our standard form. Maximize Z = 5 x 1 + 4 x
More informationIE418 Integer Programming
IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 2nd February 2005 Boring Stuff Extra Linux Class: 8AM 11AM, Wednesday February 9. Room??? Accounts and Passwords
More informationPoints: The first problem is worth 10 points, the others are worth 15. Maximize z = x y subject to 3x y 19 x + 7y 10 x + y = 100.
Math 5 Summer Points: The first problem is worth points, the others are worth 5. Midterm # Solutions Find the dual of the following linear programming problem. Maximize z = x y x y 9 x + y x + y = x, y
More informationMATH3017: Mathematical Programming
MATH3017: Mathematical Programming Nothing happens in the universe that does not have a sense of either certain maximum or minimum Leonhard Euler, Swiss Mathematician and Physicist, 1707 1783 About the
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros Final Exam, June 9, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 180 minutes. By writing your
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationMathematics for Decision Making: An Introduction. Lecture 8
Mathematics for Decision Making: An Introduction Lecture 8 Matthias Köppe UC Davis, Mathematics January 29, 2009 8 1 Shortest Paths and Feasible Potentials Feasible Potentials Suppose for all v V, there
More informationHomework Assignment 4 Solutions
MTAT.03.86: Advanced Methods in Algorithms Homework Assignment 4 Solutions University of Tartu 1 Probabilistic algorithm Let S = {x 1, x,, x n } be a set of binary variables of size n 1, x i {0, 1}. Consider
More informationCSC Design and Analysis of Algorithms. LP Shader Electronics Example
CSC 80- Design and Analysis of Algorithms Lecture (LP) LP Shader Electronics Example The Shader Electronics Company produces two products:.eclipse, a portable touchscreen digital player; it takes hours
More 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 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 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 informationMathematical Programs Linear Program (LP)
Mathematical Programs Linear Program (LP) Integer Program (IP) Can be efficiently solved e.g., by Ellipsoid Method Cannot be efficiently solved Cannot be efficiently solved assuming P NP Combinatorial
More informationWeek 2. The Simplex method was developed by Dantzig in the late 40-ties.
1 The Simplex method Week 2 The Simplex method was developed by Dantzig in the late 40-ties. 1.1 The standard form The simplex method is a general description algorithm that solves any LPproblem instance.
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 informationC&O 355 Mathematical Programming Fall 2010 Lecture 18. N. Harvey
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey Network Flow Topics Max Flow / Min Cut Theorem Total Unimodularity Directed Graphs & Incidence Matrices Proof of Max Flow / Min Cut Theorem
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 informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More information1 Simplex and Matrices
1 Simplex and Matrices We will begin with a review of matrix multiplication. A matrix is simply an array of numbers. If a given array has m rows and n columns, then it is called an m n (or m-by-n) matrix.
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 informationFundamentals of Operations Research. Prof. G. Srinivasan. Indian Institute of Technology Madras. Lecture No. # 15
Fundamentals of Operations Research Prof. G. Srinivasan Indian Institute of Technology Madras Lecture No. # 15 Transportation Problem - Other Issues Assignment Problem - Introduction In the last lecture
More informationCS261: Problem Set #3
CS261: Problem Set #3 Due by 11:59 PM on Tuesday, February 23, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:
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 information