DUALITY AND SENSITIVITY ANALYSIS
|
|
- Johnathan Norris
- 6 years ago
- Views:
Transcription
1 DUALITY AND SENSITIVITY ANALYSIS Understanding Duality No learning of Linear Programming is complete unless we learn the concept of Duality in linear programming. It is impossible to separate the linear programming problem and its dual. Several algorithms to solve special linear programming problems are centered around the concept of duality. Even though the emphasis of this book is to solve LP problems and understand to interpret the solutions, we deviate from the main focus of applications to understand duality. We will however retain the methodology of solving LPs to understand the concepts and applications. We explain duality using an example. In Illustration 1.1, we formulated and solved the LP problem to maximize the revenue for the bakery. The problem is to Maximize 32X X 2 5X 4X 59 4X 3X 46 X1, X2 0. The optimum solution obtained using the solver is X 1 = 7, X 2 = 6 with Z = 374 We consider another LP given below: Illustration 1.18 Minimize 59Y Y 2 5Y 4Y 32 4Y 3Y 25 Y1, Y2 0. We solve this LP using the solver. The final output is given in Table 1.16 Table 1.16 Solution for Illustration 1.18 y1 y >= 32
2 25 >= 25 4 >= 0 3 >= 0 The optimum solution is Y 1 = 4, Y 2 = 3 with objective function value W = 374. Now considering the maximization problem (called P1) and the minimization problem (called P2) we make the following observations: 1. P1 and P2 had the same value of the objective function at the optimum 2. The objective function coefficient coefficients of P1 are the RHS values of P2 and vice versa. 3. The number of variables in P1 and the number of constraints in P2 are equal and vice versa. The obvious question is Is there a relationship between P1 and P2? The relationship is established using the discussion that follows: 1. Consider P1 (the maximization problem). If there were no constraints the objective function value is. Let us try to get upper estimates for the value of Z. 2. We multiply the second constraint by 9 to get 36X X Since X 1 and X 2 are 0, 32X X 2 36X X Therefore Z * We multiply the first constraint by 7 to get 35X X Since X 1 and X 2 are 0, 32X X 2 35X X Therefore Z * 413 and this is a better upper estimate for Z * 4. We add the two constraints to get 9X 1 + 7X This inequality holds because X 1 and X 2 are 0, We multiply this constraint by 4 to get 36X X Since X 1 and X 2 are 0, 32X X 2 36X X Therefore 420 is an upper estimate of Z * but we ignore this because our current best estimate is We multiply the constraint 4X 1 + 3X 2 46 by 25/3 to get 33.33X X Based on the above discussions, is a better upper estimate for Z *. 6. We multiply the constraint 5X 1 + 4X 2 59 by 32/5 to get 32X X Based on the above discussions, is a better upper estimate for Z *. 7. We multiply the constraint 9X 1 + 7X by 25/7 to get 32.14X X Now 375 is a better upper estimate for Z *. Here we have added the two constraints and multiplied by 25/7. This is the same as multiplying the constraints by 25/7 and adding them. 8. We can multiply the first constraint by a and the second by b and add them. If on addition the coefficients of X 1 and X 2 are 59 and 46 respectively, the RHS value (which is 59a + 46b) is an upper estimate of Z. We should have a, b 0, otherwise the sign of the inequality will change and we cannot add the inequalities. 9. If we want the best estimate of Z * (as small an upper estimate as possible) we need to define a and b such that 59a + 46b is as small as possible.
3 10. We therefore define a and b to minimize 59a + 46b is minimized. This leads us to another LP problem (where the variables are defines as Y 1 and Y 2 instead of a and b) which is P2. Minimize 59Y Y 2 5Y 4Y 32 4Y 3Y 25 Y1, Y2 0. Therefore problem P2 is born out of P1. The problem P2 is called the dual of the given problem P1 (called the primal). 1. Do the primal and dual have the same value of the objective function at the optimum? Yes. If both have optimum solutions their objective function value is the same. This result is called the main duality theorem. If the primal and dual have optimal solutions, the objective function value at the optimum for both is the same. 2. Can we read the solution of the dual from the solution of the primal? Yes. When the LP is written into the solver, we click options and click linear model and non negative. After we solve the LP, the solver dialogue box shows option for three reports. We can click on them and press OK. The reports are available as active sheets. If we go to the sensitivity report, we see a table under constraints. This part is shown in Table 1.17 Table Sensitivity analysis report Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $B$6 x $B$7 x $B$8 x E+30 $B$9 x E+30 The shadow prices against the two constraints are 4 and 3 respectively. These are the values of Y 1 and Y 2 at the optimum. (We will see the relationship between the shadow prices and the dual solution later). 3. Does the algebraic method show the dual solution? YES. The algebraic method terminated for our LP problem with the equations
4 X 1 = 7 + 3X 3 4X 4 X 2 = 6-4X 3 + 5X 4 and Z = 374-4X 3 3X 4. We terminated by saying that the revenue function cannot be maximized further by increasing X 3 or X 4 (by increasing the non utilization or by keeping some resources idle). At the optimum the solution is X 1 = 7 and X 2 =6. The coefficients of X 3 and X 4 in the objective function at the optimum (in the algebraic method) represent the dual solution (with a negative sign). The dual solution is Y 1 = 4 and Y 2 =3 with W = 374 (It is customary to use W to represent the objective function of the dual). 4. Since the primal and dual have the same value of the objective function, how do we define the dual variables? The optimum solution to the dual is Y 1 = 4 and Y 2 =3 with W = 59 x x 3 = 374. The values Y 1 = 4 and Y 2 =3 represent the worth of the 59 units of the first resource and 46 units of the second resource at the optimum. The dual solution represents the worth of the resources at the optimum. 5. What is shadow price and why is it related to the resources (primal constraints)? We have already seen that the dual solution represents the worth of one unit of each resource at the optimum. Let us explain it further using an example. Here we increase the first resource of the primal by 1 to 60. Illustration 1.19 Solve the LP - Maximize 32X X 2 5X 4X 60 4X 3X 46 X1, X2 0. The optimum solution to the primal (using solver) is given in Table 1.18 Table 1.18 Solver Solution x1 x obj fn <= 60
5 46 <= 46 4 >= 0 10 >= 0 The optimum solution is X 1 = 4, X 2 = 10 with Z = 378. We continue to produce both the items but with different quantities. The objective function value has increased by 4 to 378. This shows that if we can increase the RHS of the first resource by 1, the profit increases by 4 (as long as we continue to produce the same products as before). The worth of the additional resource at the optimum is the extent to which the revenue goes up on increase of the resource. This is called the shadow price of the resource at the optimum or the worth of an additional amount of the resource at the optimum or the marginal value of the resource at the optimum. This is represented by the optimum solution of the dual. We restore the RHS of the first constraint to 59 and decrease the second resource by 1 to 45. Illustration 1.20 Solve the LP - Maximize 32X X 2 5X 4X 59 4X 3X 45 X1, X2 0. The optimum solution to the primal (using solver) is given in Table 1.19 Table 1.19 Optimum solution from solver x1 x obj fn <= <= 45 3 >= 0 11 >= 0 The optimum solution is X 1 = 3, X 2 = 11 with Z = 371. We continue to produce both the items but with different quantities. The objective function value has decreased by 3 to 371. This shows that if we decrease the RHS of the first resource by 1, the profit decreases by 3 (as long as we continue to produce the same products as before). The worth of the additional resource at the optimum is the extent to which the
6 revenue decreases on decrease of the resource. This is called the shadow price of the resource at the optimum. This is represented by the optimum solution of the dual. 6. How do I write the dual for a given primal? The relationship between the primal and the dual are given in Table 1.20 Table 1.20 Primal dual relationships Primal Dual Maximization Minimization Number of variables Number of constraints Number of constraints Number of variables Objective function values RHS values RHS values Objective function values Coefficient matrix for Transpose of the constraint coefficient constraints matrix variable constraint variable constraint Unrestricted variable Constraint is an equation constraint variable constraint variable equation Unrestricted variable Illustration 1.21 Consider the LP Minimize 59Y Y Y 3 5Y 4Y 3Y Y 3Y 8Y Y 5Y 9Y Y 2Y 3Y 15 3 Y 0, Y unrestricted, Y 0. 3 Write the dual to this LP and solve the dual? Using the information in Table 1.20 (treating the minimization problem as primal) we get the dual as Maximize 32X 1 +26X X 3 +15X 4 5X 4X 2X 3X X 3X 5X 2X X 8X 9X 3X X unrestricted, X 0, X 0, X 0 3 4
7 We solve the primal and the dual optimally using the solver. Since we have a variable and an unrestricted variable, we go to options and leave out the non negativity restriction there. We write Y 1 0 and Y 2 0 as explicit constraints. We don t have a restriction on Y 2 and we do not restrict it. There is no constraint for Y 2 unrestricted. Table 1.21 gives the solver output. Table 1.21 Solver output y1 y2 y obj = >= 26 6 <= >= 15 8 >= 0 0 <= 0 The optimum solution is Y 1 = 8, Y 2 = -2 and Y 3 = 0 with Z = 380 We now solve the dual. The solution to the dual is given in Table 1.22 Table 1.22 Solution to the dual x1 x2 x3 x obj fn <= = >= 37 6 >= 0 0 <= 0 0 >= 0 The solution is X 1 = 7, X 2 = 6 with W = It was mentioned that the dual value for a resource is the increase in profit for unit increase in the resource. If we increase the resource by a large value will the objective function value increase at the rate of the dual?
8 Illustration 1.22 Maximize 32X X 2 5X 4X 59 4X 3X 45 X1, X2 0 We know that the dual solution is Y 1 =4, Y 2 = 3. We have already seen that if the RHS of the first constraint becomes 60, the solution to the primal is X 1 =4, X 2 = 10 with Z = 378. When RHS = 62, the solution is X 1 = 0, X 2 = with Z = We observe that the objective function has not increased by 12 when the RHS of the first constraint is increased by 3. When RHS = 61.3, the solution is X 1 = 0.1, X 2 = 15.2with Z = We observe that the objective function has increased by 9.2 when the RHS of the first constraint is increased by 3.2. The linear increase continues because we continue to produce X 1 and X 2. At RHS = , we produce X 1 = 0, X 2 = with Z = The limiting value up to which the linearity holds is This is given in Table 6.2 as the allowable increase and allowable decrease for both the resources. As we keep increasing (decreasing) the value of the RHS (resource) the combination of products made changes. At that point, the shadow price changes and the proportional increase (decrease) in the objective function also changes. 8. Is the first dual variable related to the first constraint or the primal (resource)? Yes. We have as many dual variables as the number of constraints in the primal. For every primal constraint there is a dual variable. The dual variable represents the value of the corresponsing resource at the optimum. 9. Can a dual variable take zero value? Yes. We explain this through an example
9 Illustration 1.23 Maximize 32X X 2 5X 4X 59 4X 3X 46 3X 2X 30 X1, X2 0. The optimum solution to the primal is given in Table 1.23 Table 1.23 Optimum solution from the solver X1 X <= <= <= 30 The solution is given by X 1 = 1, X 2 = 13.5 and Z = We store the sensitivity result for this solution. Table 1.24 shows the sensitivity results. Table 1.24 Sensitivity results Microsoft Excel 12.0 Sensitivity Report Worksheet: [Book1]Sheet1 Report Created: :19:38 Adjustable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$2 X $C$2 X Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $B$6 X E+30 $B$7 X E
10 $B$8 X E+30 From the shadow prices, we find that the dual solution is Y 1 = 5.5, Y 2 = 0 and Y 3 = 1.5 with W = 59 x x 1.5 = We observe that the objective function value of the primal and dual at the optimum is Here we observe that Y 2 = 0 indicating that the value of the second dual variable is zero. From Table 6.8 we observe that the primal optimal solution X 1 = 1, X 2 = 13.5 completely utilizes resource 1 and 3 (in the primal) but uses only 44.5 out of the available 46 units of the second resource. We also observe that Y 2 (the dual variable corresponding to this resource) is zero. At the optimum, when the primal resource is utilized fully, the dual variable has a positive value. When a resource is not utilized fully the corresponding dual variable is zero. The dual variable is the marginal value of the resource at the optimum. It also represents the price at which an additional resource can be bought at the optimum. It is obvious that when a resource is not utilized fully, increasing it will not increase the revenue. Therefore the shadow price or marginal value of such a resource is zero. Illustration 1.24 Consider a small factory that makes two types of furniture tables and chairs. They use two resources wood and steel. The amount of steel used per unit is 4 kg and 5 kg for a table and a chair. The amount of wood required per table and chair is 6 and 5 kg. We have 60 kg of steel and 80 kg of wood. The selling price of table and chair is Rs 80 and 70 respectively. Find the number of tables and chairs to be made to maximize revenues. Let X 1 and X 2 be the number of tables and chairs produced. The corresponding LP problem is to Maximize 80X X 2 4X 1 + 5X X 1 + 5X 2 80 X 1, X 2 0 The optimum solution to the LP is X 1 = 10, X 2 = 4 with revenue = Worth of the resource at the optimum Consider the optimum solution X 1 = 10, X 2 = 4. We observe that we have consumed 60 kg of steel and 80 kg of wood to make 10 tables and 4 chairs. In the example, at the optimum we have consumed all the resources that we had, converted them into produces that have fetched us the revenue. It is therefore not incorrect to consider that the worth if the resources put together is the total revenue that we have earned by converting them into products. Let us try to compute the worth of the resources at the optimum using the example
11 Illustration 1.25 Consider the data given in Illustration Use the optimum solution X 1 = 10 and X 2 = 4 (if required) and try to formulate an LP problem to determine the value (or worth) of the resources at the optimum? Let Y 1 and Y 2 be the worth of 1 kg of steel and wood at the optimum. The worth of a table is 4Y 1 + 6Y 2 and the worth of a chair is 5Y 1 + 5Y 2. Now 4Y 1 + 6Y 2 should be 80 and 5Y 1 + 5Y 2 70 (The worth of a table should not be less than the selling price of 80; otherwise we would not convert the raw material into products and sell them). If the value of the unit resource represents the cost price of the resource (at the optimum), we would minimize the cost price which is to minimize 60Y Y 2. The corresponding LP that determines the value of the resources at the optimum is to Minimize 60Y Y 2 4Y 1 + 6Y Y 1 + 5Y 2 70 Y 1, Y 2 0 The optimum solution to this LP is Y 1 = 2, Y 2 = 12 with total worth = It is to be noted that expectedly, the total revenue is equal to the total worth of the resource at the optimum. Shadow price and the marginal value of the resources When we computed the value of the resource, we assumed that Y 1 and Y 2 represented the cost price or market price of a unit of the resource. This price is the shadow price of the resource and represents the price of unit resource at the optimum. In our example, we were able to convert 60 kg of steel and 80 kg of wood to 10 tables and 4 chairs having total revenue (worth) of Rs Let us solve the problem assuming that we have 61 kg of steel and 80 kg of wood. Illustration 1.26 Solve the problem in Illustration 1.24 considering 61 kg of steel and interpret the solution? What happens if we wish to have 70 kg and 90 kg of steel? The corresponding LP would be Maximize 80X X 2 4X 1 + 5X X 1 + 5X 2 80 X 1, X 2 0 The optimum solution is given by X 1 = 9.5, X 2 = 4.6 with revenue = We observe that a unit increase of steel results in an increase of revenue of Rs 2. If we were to buy the extra
12 resource (at the optimum) from the market, its worth is Rs 2 because it can fetch us additional revenue of Rs 2. This is the same as Y 1 = 2 in example 2. The value of Y 1 is called the marginal value of resource 1 at the optimum which is the additional worth of a unit of the resource. The reader would observe that the optimum solution now has X 1 = 9.5 and X 2 = 4.6. The reader can ask a question as to whether we can make and sell a fractional number of tables and chairs. The answer is that we are solving LP problem that allows fractional values for the variables. In fact the proportionality assumption makes us believe that 0.5 tables is worth Rs 40 just as half a kg of the first resource is worth Re 1 at the optimum! When we solve for 70 kg of steel, the optimum solution is given by X 1 = 5, X 2 = 10 with revenue = The additional 10 kg of steel fetched us additional revenue of Rs 20 at the rate of Rs 2/kg for the additional 10kgs. We solve for 70 kg of steel and 90 kg of wood. The optimum solution is given by X 1 = 10 and X 2 = 6 with revenue = The additional revenue is = 140. The extra 10 kg of steel is worth 20 and the extra 10 kg of wood is worth 120 (at the rate of 12 per kg for 10 kg note that Y 2 =10, indicating that the worth of 1 kg of wood at the optimum is Rs 10). We observe that the additional cost of the resource is equal to the additional revenue. We solve for 90 kg of steel and 80 kg of wood. The optimum solution is given by X 2 = 16 with revenue = If we assume that the marginal value of steel is Rs 2, the additional cost is Rs 60 while the additional revenue is only Rs 40. Here, the additional cost does not get reflected as additional revenue. We observe that the proportionality works till we increase the steel quantity to 80 after which we do not produce tables. The proportionality will hold only till the same set of products is made (at different quantities). When the set of products made changes, the extra cost and the extra revenue are not equal. Illustration 1.27 Consider the data in Illustration In addition it is observed that it takes 8 hours to make a table and 5 hours to make a chair. The company works 5 days a week and 16 hours a day. Assume that the products have to be made in a week. We have a third constraint which relates the time required to the time available. The problem is to Maximize 80X X 2 4X 1 + 5X X 1 + 5X X 1 + 5X 2 80 X 1, X 2 0
13 The optimum solution to the LP is given by X 1 = 5, X 2 = 8 with revenue = 960. It is observed that 60 units of steel is consumed, 70 units of wood is consumed and 80 hours of time is consumed. It is observed that the second resource is not fully consumed. The sensitivity report from the excel solver shows that the shadow prices are 8, 0 and 6 for the three resources. The worth of the resources are 60 x x X 6 = 960 which is equal to the revenue. It is observed that the shadow price of resource 2 is zero. This is because this resource is not fully consumed. Obviously the marginal value (cost) of this resource is zero because we need not pay extra to buy a unit of this resource since it is available with us. Shadow prices are positive for resources that are scarce (fully consumed). Shadow price is zero when a resource is not fully consumed. Does it mean that the wood used has no value? The answer is No. It is acceptable to say that the marginal value (or the implied cost of procuring an extra kg) is zero since the resource is available with us. When the shadow price is zero we should not assume that the worth is zero. The 70 kg of wood consumed has a value which is not visible at the optimum. Only the marginal value at the optimum has to be interpreted as zero. The total revenue of 960 is distributed between the value of the other two resources at the optimum Sensitivity Analysis Sensitivity analysis deals with the sensitivity of the solution to an LP to changes in problem parameters. The parameters that can change are: 1. Change in Right hand side (RHS) values in the constraints 2. Change in objective function values 3. Changes in coefficients of constraints. In addition two more aspects are included in sensitivity analysis. These are 1. Adding a variable (product) 2. Adding a constraint. In the days when LPs were solved by hand or when solvers were not available freely, it was necessary to compute the effect of the above changes from the optimal solution. Sensitivity analysis methods essentially did that and obtained the optimum solution after the changes from the given optimum. So long as the changes were not on the coefficients of the constraints corresponding to the decision variables in the optimum solution, it is possible to carry out sensitivity analysis from the present optimum solution.
14 Since we are using the excel solver, we do not emphasize much on sensitivity analysis because it is possible to solve the problem from the beginning using the solver for every change made. We need to make changes in the template and modify the constraints or the objective in the solver. Illustration 1.28 Maximize 32X X 2 5X 4X 59 4X 3X 46 X1, X2 0. Table 1.25 shows the results of modifying some of the parameters. Table 1.25 Results after modifying some parameters No. Parameter Original Changed value Solution value 1. Objective coeff X 1 = 7, X 2 = 6 with Z = Objective coeff X 1 = 11.5 X 2 = 0 with Z = Objective coeff X 1 = 7, X 2 = 6 with Z = X 1 = 0, X 2 = with Z = Objective coeff X 1 = 0, X 2 = with Z = Objective coeff X 1 = 7, X 2 = 6 with Z = X 1 = 0, X 2 = 14.75with Z = Objective coeff X 1 = 0, X 2 = 14.75with Z = Objective coeff X 1 = 7, X 2 = 6 with Z = 368 X 1 = 11.5, X 2 = 0 with Z = RHS X 1 = 4, X 2 = 10 with Z = RHS X 1 =0, X 2 = with Z = RHS X 1 = 11.5, X 2 = 0 with Z = RHS X 1 = 11, X 2 = 1 with Z = RHS X 1 = 11.8, X 2 = 0 with Z = RHS X 1 = 0, X 2 = with Z = From Table 1.25 we observe the following:
15 1. When the objective function coefficient of the first variable (C 1 ) increases up to 33.33, we produce X 1 and X 2. When it increases to 33.5 we produce only X 1. The limiting value for this coefficient is an increase of 1.5 at/after which the products made changes. 2. The lower limiting value for C 1 is a reduction of 0.75 at/after which we make only X 2. At the limiting value we can have two (or more) solutions. We have shown two solutions under item 3. In fact at all limiting values we have alternate optima. 3. When the objective function coefficient of the first variable (C 2 ) can be increased up to 25.6, we produce X 1 and X 2. When it increases to 25.6 we produce only X 2. The limiting value for this coefficient is an increase of 0.6 at/after which the products made changes. At the limiting value we can have two (or more) solutions. We have shown two solutions under item 5. In fact at all limiting values we have alternate optima. 4. The lower limiting value for C 2 is a reduction of 1 at/after which we make only X 1. At the limiting value we can have two (or more) solutions. We have shown two solutions under item 7. In fact at all limiting values we have alternate optima. 5. We observe that when the RHS of the first constraint goes up to we start producing only X 2 and if it reduces to 57.5 we make only X 1. The limiting values are and 1.5 respectively. 6. We observe that when the RHS of the second constraint goes up to 47.2 we start producing only X 1 and if it reduces to we make only X 2. The limiting values are 1.2 and 1.75 respectively. The observations in Table 1.25 are based on solving the LP problem at least ten times using the solver. It is not a difficult task but one of the reports that can be obtained from the solution to the original problem (sensitivity analysis report) gives all the above information. After we solve the problem, we get a message keep solver solution and we can retain the solver solution. On the right hand side we have the following three options: 1. Answer 2. Sensitivity 3. Limits We can click on the Sensitivity and the solver creates a sheet called Sensitivity report 1. The sheet looks as shown in Table 1.26 Table 1.26 Sensitivity Report Microsoft Excel 12.0 Sensitivity Report Worksheet: [Book1]Sheet1 Report Created: 5/31/2010 3:09:56 PM
16 Adjustable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$2 x $C$2 x Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $B$6 x $B$7 x The allowable increase and decrease for the coefficients in the objective function and for the constraints can be read from Table The shadow prices indicate the optimum solution to the dual. Thus the sensitivity analysis report provides certain basic information about the solution to the dual. It also tells us the extent to which the solution is sensitive to changes in coefficients in the objective function and to RHS values. The limiting values where there is a change in the products made is known when the original problem is solved. Illustration 1.29 Consider the data given in Illustration The sensitivity analysis report given when the problem is solved using Excel solver is reproduced in Table 1.27 Interpret the solver report to explain the sensitivity of the LP parameters. Table 1.27 Solver Report Variable Values Obj fn Increase Decrease X X Constraint Value Shadow Price Increase Decrease The table shows that the optimum solution to the given problem is X 1 = 10, X 2 = 4. The shadow prices for the two resources are 2 and 12 respectively. When the objective function coefficient for X 1 can be increased to 84 and decreased to 56, we will continue to produce both items. When this value goes out of this range, we will not produce tables. Similarly when the revenue from chair is within 100 and , we will produce chairs. When the revenue goes beyond these values, we will produce a different combination of items.
17 When the availability of resource 1 is between 80 and , the revenue increase (or decrease) will be at the rate of Rs 2 per kg. Similarly, till the availability of the second resource is between 90 and 60, the increase or decrease in revenue will be Rs 12 for unit increase or decrease of the resource. What happens when the objective function coefficients are 50 and 50 and the availability of resources is 60 and 50? The optimum solution to the LP is X 2 = 10 and revenue = 500. The problem becomes a new LP which is quite unrelated to the old LP that we are solving. It only shows that some linear relationships among the variables are not valid at the new values.
Introduction to Operations Research
Introduction to Operations Research Unit 1: Linear Programming Terminology and formulations LP through an example Terminology Additional Example 1 Additional example 2 A shop can make two types of sweets
More informationSensitivity Analysis LINDO INPUT & RESULTS. Maximize 7X1 + 10X2. Subject to X1 < 500 X2 < 500 X1 + 2X2 < 960 5X1 + 6X2 < 3600 END
Sensitivity Analysis Sensitivity Analysis is used to see how the optimal solution is affected by the objective function coefficients and to see how the optimal value is affected by the right- hand side
More informationSCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT. BF360 Operations Research
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit 3 Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 3: Sensitivity and Duality 3 3.1 Sensitivity
More informationLecture 3. Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges
Decision Models Lecture 3 1 Lecture 3 Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges Bidding Problems Summary and Preparation
More information36106 Managerial Decision Modeling Sensitivity Analysis
1 36106 Managerial Decision Modeling Sensitivity Analysis Kipp Martin University of Chicago Booth School of Business September 26, 2017 Reading and Excel Files 2 Reading (Powell and Baker): Section 9.5
More informationGame Theory Tutorial 3 Answers
Game Theory Tutorial 3 Answers Exercise 1 (Duality Theory) Find the dual problem of the following L.P. problem: max x 0 = 3x 1 + 2x 2 s.t. 5x 1 + 2x 2 10 4x 1 + 6x 2 24 x 1 + x 2 1 (1) x 1 + 3x 2 = 9 x
More informationCHAPTER 13: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL
CHAPTER 1: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL The previous chapter introduced harvest scheduling with a model that minimized the cost of meeting certain harvest targets. These harvest targets
More informationEcon 172A - Slides from Lecture 7
Econ 172A Sobel Econ 172A - Slides from Lecture 7 Joel Sobel October 18, 2012 Announcements Be prepared for midterm room/seating assignments. Quiz 2 on October 25, 2012. (Duality, up to, but not including
More informationCOMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN
COMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN TABLE OF CONTENTS I. Vocabulary Overview II. Solving Algebraically and Graphically III. Understanding Graphs IV. Fruit Juice Excel V. More on Sensitivity
More informationContinuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization
1 of 6 Continuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization 1. Which of the following is NOT an element of an optimization formulation? a. Objective function
More informationy 3 z x 1 x 2 e 1 a 1 a 2 RHS 1 0 (6 M)/3 M 0 (3 5M)/3 10M/ / /3 10/ / /3 4/3
AMS 341 (Fall, 2016) Exam 2 - Solution notes Estie Arkin Mean 68.9, median 71, top quartile 82, bottom quartile 58, high (3 of them!), low 14. 1. (10 points) Find the dual of the following LP: Min z =
More informationAdvanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras Lecture 23 Minimum Cost Flow Problem In this lecture, we will discuss the minimum cost
More informationPERT 12 Quantitative Tools (1)
PERT 12 Quantitative Tools (1) Proses keputusan dalam operasi Fundamental Decisin Making, Tabel keputusan. Konsep Linear Programming Problem Formulasi Linear Programming Problem Penyelesaian Metode Grafis
More informationLinear Programming: Sensitivity Analysis and Interpretation of Solution
8 Linear Programming: Sensitivity Analysis and Interpretation of Solution MULTIPLE CHOICE. To solve a linear programming problem with thousands of variables and constraints a personal computer can be use
More informationMODULE-1 ASSIGNMENT-2
MODULE-1 ASSIGNMENT-2 An investor has Rs 20 lakhs with her and considers three schemes to invest the money for one year. The expected returns are 10%, 12% and 15% for the three schemes per year. The third
More information$B$8 B&D
1. An Excel Solver sensitivity report for a linear programming model is given below. INTERPRET ALL of the information given for decision variable C (Adjustable Cells Table) and constraint C&D ( Table).
More informationDuality & The Dual Simplex Method & Sensitivity Analysis for Linear Programming. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1
Dualit & The Dual Simple Method & Sensitivit Analsis for Linear Programming Metodos Cuantitativos M. En C. Eduardo Bustos Farias Dualit EverLP problem has a twin problem associated with it. One problem
More informationFebruary 24, 2005
15.053 February 24, 2005 Sensitivity Analysis and shadow prices Suggestion: Please try to complete at least 2/3 of the homework set by next Thursday 1 Goals of today s lecture on Sensitivity Analysis Changes
More informationINTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations
Hun Myoung Park (4/18/2018) LP Interpretation: 1 INTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations DCC5350 (2 Credits) Public Policy
More informationOPTIMIZAÇÃO E DECISÃO 10/11
OPTIMIZAÇÃO E DECISÃO 10/11 PL #1 Linear Programming Alexandra Moutinho (from Hillier & Lieberman Introduction to Operations Research, 8 th edition) The Wyndor Glass Co. Problem Wyndor Glass Co. produces
More informationAM 121: Intro to Optimization Models and Methods Fall 2017
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 8: Sensitivity Analysis Yiling Chen SEAS Lesson Plan: Sensitivity Explore effect of changes in obj coefficients, and constraints on the
More information56:171 Operations Research Midterm Exam Solutions October 19, 1994
56:171 Operations Research Midterm Exam Solutions October 19, 1994 Possible Score A. True/False & Multiple Choice 30 B. Sensitivity analysis (LINDO) 20 C.1. Transportation 15 C.2. Decision Tree 15 C.3.
More informationDennis L. Bricker Dept. of Industrial Engineering The University of Iowa
Dennis L. Bricker Dept. of Industrial Engineering The University of Iowa 56:171 Operations Research Homework #1 - Due Wednesday, August 30, 2000 In each case below, you must formulate a linear programming
More informationNote on Using Excel to Compute Optimal Risky Portfolios. Candie Chang, Hong Kong University of Science and Technology
Candie Chang, Hong Kong University of Science and Technology Andrew Kaplin, Kellogg Graduate School of Management, NU Introduction This document shows how to, (1) Compute the expected return and standard
More informationEcon 172A, W2002: Final Examination, Solutions
Econ 172A, W2002: Final Examination, Solutions Comments. Naturally, the answers to the first question were perfect. I was impressed. On the second question, people did well on the first part, but had trouble
More informationGraphical Sensitivity Analysis
What if there is uncertainly about one or more values in the LP model? Sensitivity analysis allows us to determine how sensitive the optimal solution is to changes in data values. This includes analyzing
More informationFINANCIAL OPTIMIZATION
FINANCIAL OPTIMIZATION Lecture 2: Linear Programming Philip H. Dybvig Washington University Saint Louis, Missouri Copyright c Philip H. Dybvig 2008 Choose x to minimize c x subject to ( i E)a i x = b i,
More informationOR-Notes. J E Beasley
1 of 17 15-05-2013 23:46 OR-Notes J E Beasley OR-Notes are a series of introductory notes on topics that fall under the broad heading of the field of operations research (OR). They were originally used
More information56:171 Operations Research Midterm Examination October 25, 1991 PART ONE
56:171 O.R. Midterm Exam - 1 - Name or Initials 56:171 Operations Research Midterm Examination October 25, 1991 Write your name on the first page, and initial the other pages. Answer both questions of
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 informationTUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 16 Introduction to Game Theory
TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 52 ENGINEERING SYSTEMS Spring 20 Introduction: Lesson 6 Introduction to Game Theory We will look at the basic ideas of game theory.
More information4. Introduction to Prescriptive Analytics. BIA 674 Supply Chain Analytics
4. Introduction to Prescriptive Analytics BIA 674 Supply Chain Analytics Why is Decision Making difficult? The biggest sources of difficulty for decision making: Uncertainty Complexity of Environment or
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 21 Successive Shortest Path Problem In this lecture, we continue our discussion
More informationLinear Programming: Simplex Method
Mathematical Modeling (STAT 420/620) Spring 2015 Lecture 10 February 19, 2015 Linear Programming: Simplex Method Lecture Plan 1. Linear Programming and Simplex Method a. Family Farm Problem b. Simplex
More information56:171 Operations Research Midterm Exam Solutions Fall 1994
56:171 Operations Research Midterm Exam Solutions Fall 1994 Possible Score A. True/False & Multiple Choice 30 B. Sensitivity analysis (LINDO) 20 C.1. Transportation 15 C.2. Decision Tree 15 C.3. Simplex
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 013 Problem Set (Second Group of Students) Students with first letter of surnames I Z Due: February 1, 013 Problem Set Rules: 1. Each student
More informationFINANCIAL ASSET PRICING AND DECISION ANALYSIS
FINANCIAL ASSET PRICING AND DECISION ANALYSIS 1. Introduction When we began studying decision analysis, we assumed that the criterion for determining optimal decisions is to maximize the decision-maker's
More information56:171 Operations Research Midterm Examination Solutions PART ONE
56:171 Operations Research Midterm Examination Solutions Fall 1997 Answer both questions of Part One, and 4 (out of 5) problems from Part Two. Possible Part One: 1. True/False 15 2. Sensitivity analysis
More informationQuantitative Analysis for Management Linear Programming Models:
Quantitative Analysis for Management Linear Programming Models: 7-000 by Prentice Hall, Inc., Upper Saddle River, Linear Programming Problem. Tujuan adalah maximize or minimize variabel dependen dari beberapa
More informationOperations Research I: Deterministic Models
AMS 341 (Spring, 2010) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, March 11, 2010 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
More information56:171 Operations Research Midterm Examination Solutions PART ONE
56:171 Operations Research Midterm Examination Solutions Fall 1997 Write your name on the first page, and initial the other pages. Answer both questions of Part One, and 4 (out of 5) problems from Part
More information56:171 Operations Research Midterm Exam Solutions October 22, 1993
56:171 O.R. Midterm Exam Solutions page 1 56:171 Operations Research Midterm Exam Solutions October 22, 1993 (A.) /: Indicate by "+" ="true" or "o" ="false" : 1. A "dummy" activity in CPM has duration
More informationSolution to P2 Sensitivity at the Major Electric Company
Solution to P2 Sensitivity at the Major Electric Company 1.(a) Are there alternate optimal solutions? Yes or no. (b) If yes, which nonbasic variables could enter the basis without changing the value of
More informationTUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE
TUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE COURSE: BFN 425 QUANTITATIVE TECHNIQUE FOR FINANCIAL DECISIONS i DISCLAIMER The contents of this document are intended for practice and leaning
More information1 Shapley-Shubik Model
1 Shapley-Shubik Model There is a set of buyers B and a set of sellers S each selling one unit of a good (could be divisible or not). Let v ij 0 be the monetary value that buyer j B assigns to seller i
More informationThe application of linear programming to management accounting
The application of linear programming to management accounting After studying this chapter, you should be able to: formulate the linear programming model and calculate marginal rates of substitution and
More information56:171 Operations Research Midterm Examination October 28, 1997 PART ONE
56:171 Operations Research Midterm Examination October 28, 1997 Write your name on the first page, and initial the other pages. Answer both questions of Part One, and 4 (out of 5) problems from Part Two.
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 1.3 Recitation 1 TAs: Giacomo Nannicini, Ebrahim Nasrabadi Problem 1 You create your own start-up company that caters high-quality organic food directly to
More informationTHE UNIVERSITY OF BRITISH COLUMBIA
Be sure this eam has pages. THE UNIVERSITY OF BRITISH COLUMBIA Sessional Eamination - June 12 2003 MATH 340: Linear Programming Instructor: Dr. R. Anstee, section 921 Special Instructions: No calculators.
More informationMean-Variance Portfolio Choice in Excel
Mean-Variance Portfolio Choice in Excel Prof. Manuela Pedio 20550 Quantitative Methods for Finance August 2018 Let s suppose you can only invest in two assets: a (US) stock index (here represented by the
More informationLP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE
The Wilson Problem: Graph is at the end. LP OPTIMUM FOUND AT STEP 2 1) 5520.000 X1 360.000000 0.000000 X2 300.000000 0.000000 2) 0.000000 1.000000 3) 0.000000 2.000000 4) 140.000000 0.000000 5) 200.000000
More informationLecture 2: Fundamentals of meanvariance
Lecture 2: Fundamentals of meanvariance analysis Prof. Massimo Guidolin Portfolio Management Second Term 2018 Outline and objectives Mean-variance and efficient frontiers: logical meaning o Guidolin-Pedio,
More informationThe Lagrangian method is one way to solve constrained maximization problems.
LECTURE 4: CONSTRAINED OPTIMIZATION QUESTIONS AND PROBLEMS True/False Questions The Lagrangian method is one way to solve constrained maximization problems. The substitution method is a way to avoid using
More informationLecture 3: Factor models in modern portfolio choice
Lecture 3: Factor models in modern portfolio choice Prof. Massimo Guidolin Portfolio Management Spring 2016 Overview The inputs of portfolio problems Using the single index model Multi-index models Portfolio
More informationOptimization for Chemical Engineers, 4G3. Written midterm, 23 February 2015
Optimization for Chemical Engineers, 4G3 Written midterm, 23 February 2015 Kevin Dunn, kevin.dunn@mcmaster.ca McMaster University Note: No papers, other than this test and the answer booklet are allowed
More information3.3 - One More Example...
c Kathryn Bollinger, September 28, 2005 1 3.3 - One More Example... Ex: (from Tan) Solve the following LP problem using the Method of Corners. Kane Manufacturing has a division that produces two models
More informationOptimize (Maximize or Minimize) Z=C1X1 +C2X2+..Cn Xn
Linear Programming Problems Formulation Linear Programming is a mathematical technique for optimum allocation of limited or scarce resources, such as labour, material, machine, money, energy and so on,
More informationCOMP331/557. Chapter 6: Optimisation in Finance: Cash-Flow. (Cornuejols & Tütüncü, Chapter 3)
COMP331/557 Chapter 6: Optimisation in Finance: Cash-Flow (Cornuejols & Tütüncü, Chapter 3) 159 Cash-Flow Management Problem A company has the following net cash flow requirements (in 1000 s of ): Month
More informationCSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems
CSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems January 26, 2018 1 / 24 Basic information All information is available in the syllabus
More informationCharacterization of the Optimum
ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 5. Portfolio Allocation with One Riskless, One Risky Asset Characterization of the Optimum Consider a risk-averse, expected-utility-maximizing
More informationDo all of Part One (1 pt. each), one from Part Two (15 pts.), and four from Part Three (15 pts. each) <><><><><> PART ONE <><><><><>
56:171 Operations Research Final Exam - December 13, 1989 Instructor: D.L. Bricker Do all of Part One (1 pt. each), one from Part Two (15 pts.), and four from
More information32 Chapter 3 Analyzing Solutions. The solution is:
3 Analyzing Solutions 3.1 Economic Analysis of Solution Reports A substantial amount of interesting economic information can be gleaned from the solution report of a model. In addition, optional reports,
More informationLinear Programming Formulations
Linear Programming Formulations For these problems you need to answer sensitivity analysis questions using excel. These questions appear in italic fonts. The excel files are available on the course website.
More informationGE in production economies
GE in production economies Yossi Spiegel Consider a production economy with two agents, two inputs, K and L, and two outputs, x and y. The two agents have utility functions (1) where x A and y A is agent
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense May 22, 2018 Marco Chiarandini DM559/DM55 Linear and integer programming Sheet, Spring 2018 [pdf format] Contains Solutions!
More informationFINANCE THEORY: Intertemporal. and Optimal Firm Investment Decisions. Eric Zivot Econ 422 Summer R.W.Parks/E. Zivot ECON 422:Fisher 1.
FINANCE THEORY: Intertemporal Consumption-Saving and Optimal Firm Investment Decisions Eric Zivot Econ 422 Summer 21 ECON 422:Fisher 1 Reading PCBR, Chapter 1 (general overview of financial decision making)
More informationAppendices to NCHRP Research Report 903: Geotechnical Asset Management for Transportation Agencies, Volume 2: Implementation Manual
Appendices to NCHRP Research Report 903: Geotechnical Asset Management for Transportation Agencies, Volume 2: Implementation Manual This document contains the following appendices to NCHRP Research Report
More informationLesson Topics. B.3 Integer Programming Review Questions
Lesson Topics Rounding Off (5) solutions in continuous variables to the nearest integer (like 2.67 rounded off to 3) is an unreliable way to solve a linear programming problem when decision variables should
More informationChapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem
Chapter 10: Mixed strategies Nash equilibria reaction curves and the equality of payoffs theorem Nash equilibrium: The concept of Nash equilibrium can be extended in a natural manner to the mixed strategies
More informationThe Process of Modeling
Session #3 Page 1 The Process of Modeling Plan Visualize where you want to finish Do some calculations by hand Sketch out a spreadsheet Build Start with a small-scale model Expand the model to full scale
More information17. Forestry Applications of Linear Programming
191 17. Forestry Applications of Linear Programming Steve Harrison Linear programming (LP) is a highly versatile mathematical optimization technique which has found wide use in management and economics.
More informationAn Introduction to Linear Programming (LP)
An Introduction to Linear Programming (LP) How to optimally allocate scarce resources! 1 Please hold your applause until the end. What is a Linear Programming A linear program (LP) is an optimization problem
More informationCourse notes for EE394V Restructured Electricity Markets: Locational Marginal Pricing
Course notes for EE394V Restructured Electricity Markets: Locational Marginal Pricing Ross Baldick Copyright c 2018 Ross Baldick www.ece.utexas.edu/ baldick/classes/394v/ee394v.html Title Page 1 of 160
More information1.2: USING ALGEBRA(meaning no calculators), find the Intersection of the two Lines.
Math 125 Final Exam Practice HAPTE 1: 1.1: List the Intercepts of each Equation and then sketch the graph 18x+ 10y = 90 b) 16x+ 24y = 432 c) 25x+ 10y = 500 1.2: USING ALGEBA(meaning no calculators), find
More informationHomework solutions, Chapter 8
Homework solutions, Chapter 8 NOTE: We might think of 8.1 as being a section devoted to setting up the networks and 8.2 as solving them, but only 8.2 has a homework section. Section 8.2 2. Use Dijkstra
More information(Refer Slide Time: 00:55)
Engineering Economic Analysis Professor Dr. Pradeep K Jha Department of Mechanical and Industrial Engineering Indian Institute of Technology Roorkee Lecture 11 Economic Equivalence: Meaning and Principles
More informationStep 2: Determine the objective and write an expression for it that is linear in the decision variables.
Portfolio Modeling Using LPs LP Modeling Technique Step 1: Determine the decision variables and label them. The decision variables are those variables whose values must be determined in order to execute
More informationSensitivity Analysis for LPs - Webinar
Sensitivity Analysis for LPs - Webinar 25/01/2017 Arthur d Herbemont Agenda > I Introduction to Sensitivity Analysis > II Marginal values : Shadow prices and reduced costs > III Marginal ranges : RHS ranges
More informationComputational Mathematics/Information Technology
Computational Mathematics/Information Technology 2009 10 Financial Functions in Excel This lecture starts to develop the background for the financial functions in Excel that deal with, for example, loan
More informationREGIONAL WORKSHOP ON TRAFFIC FORECASTING AND ECONOMIC PLANNING
International Civil Aviation Organization 27/8/10 WORKING PAPER REGIONAL WORKSHOP ON TRAFFIC FORECASTING AND ECONOMIC PLANNING Cairo 2 to 4 November 2010 Agenda Item 3 a): Forecasting Methodology (Presented
More informationIncome and Efficiency in Incomplete Markets
Income and Efficiency in Incomplete Markets by Anil Arya John Fellingham Jonathan Glover Doug Schroeder Richard Young April 1996 Ohio State University Carnegie Mellon University Income and Efficiency in
More informationDepartment of Economics ECO 204 Microeconomic Theory for Commerce Test 2
Department of Economics ECO 204 Microeconomic Theory for Commerce 2013-2014 Test 2 IMPORTANT NOTES: Proceed with this exam only after getting the go-ahead from the Instructor or the proctor Do not leave
More informationA Study of the Efficiency of Polish Foundries Using Data Envelopment Analysis
A R C H I V E S of F O U N D R Y E N G I N E E R I N G DOI: 10.1515/afe-2017-0039 Published quarterly as the organ of the Foundry Commission of the Polish Academy of Sciences ISSN (2299-2944) Volume 17
More informationThe Impact of Basel Accords on the Lender's Profitability under Different Pricing Decisions
The Impact of Basel Accords on the Lender's Profitability under Different Pricing Decisions Bo Huang and Lyn C. Thomas School of Management, University of Southampton, Highfield, Southampton, UK, SO17
More informationProblem B.1, HR7E Solve the following LP graphically R. Saltzman
Problem B.1, HR7E Solve the following LP graphically R. Saltzman Maximize 4X + 6Y = Z subject to: (1) X + 2Y = Note: There is a typograhpical error in the book regarding
More informationWAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering
WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering PhD Preliminary Examination- February 2006 Candidate Name: Answer ALL Questions Question 1-20 Marks Question 2-15 Marks Question
More informationOptimization Methods. Lecture 7: Sensitivity Analysis
5.093 Optimization Methods Lecture 7: Sensitivity Analysis Motivation. Questions z = min s.t. c x Ax = b Slide How does z depend globally on c? on b? How does z change locally if either b, c, A change?
More informationMLC at Boise State Polynomials Activity 3 Week #5
Polynomials Activity 3 Week #5 This activity will be discuss maximums, minimums and zeros of a quadratic function and its application to business, specifically maximizing profit, minimizing cost and break-even
More informationStochastic Programming and Financial Analysis IE447. Midterm Review. Dr. Ted Ralphs
Stochastic Programming and Financial Analysis IE447 Midterm Review Dr. Ted Ralphs IE447 Midterm Review 1 Forming a Mathematical Programming Model The general form of a mathematical programming model is:
More information1 Economical Applications
WEEK 4 Reading [SB], 3.6, pp. 58-69 1 Economical Applications 1.1 Production Function A production function y f(q) assigns to amount q of input the corresponding output y. Usually f is - increasing, that
More informationRobust Optimization Applied to a Currency Portfolio
Robust Optimization Applied to a Currency Portfolio R. Fonseca, S. Zymler, W. Wiesemann, B. Rustem Workshop on Numerical Methods and Optimization in Finance June, 2009 OUTLINE Introduction Motivation &
More informationProbability and Stochastics for finance-ii Prof. Joydeep Dutta Department of Humanities and Social Sciences Indian Institute of Technology, Kanpur
Probability and Stochastics for finance-ii Prof. Joydeep Dutta Department of Humanities and Social Sciences Indian Institute of Technology, Kanpur Lecture - 07 Mean-Variance Portfolio Optimization (Part-II)
More information2016 EXAMINATIONS ACCOUNTING TECHNICIAN PROGRAMME PAPER TC 3: BUSINESS MATHEMATICS & STATISTICS
EXAMINATION NO. 16 EXAMINATIONS ACCOUNTING TECHNICIAN PROGRAMME PAPER TC : BUSINESS MATHEMATICS & STATISTICS WEDNESDAY 0 NOVEMBER 16 TIME ALLOWED : HOURS 9.00 AM - 12.00 NOON INSTRUCTIONS 1. You are allowed
More informationENGG OPT TECHNIQUES Fall 2008 SOLVED EXAMPLES
EXAMPLE 1 HILLIARD Electronics produces specially coded chips for laser surgery in 256MB and 512MB (MB stands for megabyte; where one megabyte is roughly equal to one million characters of information).
More informationThe Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis
The Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis Seller has n items for sale The Set-up Seller has n items
More informationLP Sensitivity Analysis
LP Sensitivity Analysis Max: 50X + 40Y Profit 2X + Y >= 2 (3) Customer v demand X + 2Y >= 2 (4) Customer w demand X, Y >= 0 (5) Non negativity What is the new feasible region? a, e, B, h, d, A and a form
More informationJournal of College Teaching & Learning February 2007 Volume 4, Number 2 ABSTRACT
How To Teach Hicksian Compensation And Duality Using A Spreadsheet Optimizer Satyajit Ghosh, (Email: ghoshs1@scranton.edu), University of Scranton Sarah Ghosh, University of Scranton ABSTRACT Principle
More informationStochastic Programming: introduction and examples
Stochastic Programming: introduction and examples Amina Lamghari COSMO Stochastic Mine Planning Laboratory Department of Mining and Materials Engineering Outline What is Stochastic Programming? Why should
More informationChapter 2 Portfolio Management and the Capital Asset Pricing Model
Chapter 2 Portfolio Management and the Capital Asset Pricing Model In this chapter, we explore the issue of risk management in a portfolio of assets. The main issue is how to balance a portfolio, that
More informationOptimization Models one variable optimization and multivariable optimization
Georg-August-Universität Göttingen Optimization Models one variable optimization and multivariable optimization Wenzhong Li lwz@nju.edu.cn Feb 2011 Mathematical Optimization Problems in optimization are
More information