Chapter 7 An Introduction to Linear Programming
|
|
- Josephine Small
- 6 years ago
- Views:
Transcription
1 n Introduction to Linear Programming Learning Objectives 1. Obtain an overview of the kinds of problems linear programming has been used to solve. 2. Learn how to develop linear programming models for simple problems. 3. e able to identify the special features of a model that make it a linear programming model. 4. Learn how to solve two variable linear programming models by the graphical solution procedure. 5. Understand the importance of extreme points in obtaining the optimal solution. 6. Know the use and interpretation of slack and surplus variables. 7. e able to interpret the computer solution of a linear programming problem. 8. Understand how alternative optimal solutions, infeasibility and unboundedness can occur in linear programming problems. 9. Understand the following terms: problem formulation constraint function objective function solution optimal solution nonnegativity constraints mathematical model linear program linear functions feasible solution feasible region slack variable standard form redundant constraint extreme point surplus variable alternative optimal solutions infeasibility unbounded 7-1
2 Solutions: 1. a, b, and e, are acceptable linear programming relationships. c is not acceptable because of a. d is not acceptable because of 3 f is not acceptable because of 1 c, d, and f could not be found in a linear programming model because they have the above nonlinear terms b c. 8 4 Points on line are only feasible points
3 n Introduction to Linear Programming 3. a. (,9) (6,) b. (,6) (4,) c. (,2) Points on line are only feasible solutions 4. a. (4,) (2,) (,-15) 7-3
4 b. (,12) (-1,) c. (1,25) Note: Point shown was used to locate position of the constraint line 5. a 3 c 2 1 b
5 n Introduction to Linear Programming 6. a = 42 b = 42 c = (c) 6 4 (b) 2 (a)
6 / 3 (1,2) (15,225) 1 (15,1)
7 n Introduction to Linear Programming Optimal Solution = 12/7, =15/7 Value of Objective Function = 2(12/7) + 3(15/7) = 69/ = 6 (1) = 15 (2) (1) = 3 (3) (2) - (3) - 7 = -15 = 15/7 From (1), = 6-2(15/7) = 6-3/7 = 12/7 7-7
8 11. =1 Optimal Solution =1, =5 Value of Objective Function = 75 1 = a Optimal Solution =3, =1.5 Value of Objective Function = 13.5 (3,1.5) 1 (,) (4,) 7-8
9 n Introduction to Linear Programming b. 3 Optimal Solution =, =3 Value of Objective Function = (,) c. There are four extreme points: (,), (4,), (3,1,5), and (,3). 13. a Feasible Region consists of this line segment only b. The extreme points are (5, 1) and (2, 4). 7-9
10 c Optimal Solution =2, = a. Let S = number of standard bags D = number of deluxe bags Max 1S + 9D 7 / 1 S + 1D 63 Cutting and dyeing 1 / 2 S + 1S + 1 / 1 S + 5 / 6 D 6 Sewing 2 / 3 D 78 Finishing 1 / 4 D 135 Inspection and packaging S, D Optimal Solution: S = 54 and D = 252 (see feasible region in 15a.) b. Profit = $7668 c. & d. Department Production Time Slack Cutting and Dyeing Sewing Finishing 78 Inspection and Packaging
11 n Introduction to Linear Programming 15. a. D Optimal Solution (3,4) z = 1,56 3 (54,252) 2 1 S b. Similar to part (a): the same feasible region with a different objective function. The optimal solution occurs at (78, ) with a profit of z = 2(78) + 9() = 14,16. c. The sewing constraint is redundant. Such a change would not change the optimal solution to the original problem. 16. a. variety of objective functions with a slope greater than -4/1 (slope of I & P line) will make extreme point (, 54) the optimal solution. For example, one possibility is 3S + 9D. b. Optimal Solution is S = and D = 54. c. Department Hours Used Max. vailable Slack Cutting and Dyeing 1(54) = Sewing 5 / 6 (54) = Finishing 2 / 3 (54) = Inspection and Packaging 1 / 4 (54) = Max S 1 + S 2 + S S 1 = S 2 = S 3 = 125,, S 1, S 2, S
12 18. a. b. Max S 1 + S 2 + S S 1 = S 2 = S 3 = 1,, S 1, S 2, S Optimal Solution = 18/7, = 15/7, Value = 87/ c. S 1 =, S 2 =, S 3 = 4/7 19. a. Max S 1 + S 2 + S S 1 = 8 (1) S 2 = 12 (2) S 3 = 16 (3),, S 1, S 2, S
13 n Introduction to Linear Programming b. 14 (3) 12 1 (1) Optimal Solution = 2/3, =8/3 Value = 3 2/3 2 (2) c. S 1 = = 8 + 2/3-16/3 = 28/3 S 2 = 12-2 = 12-2/3-16/3 = S 3 = = 16-4/3-8/3 = 2. a. Max S 1 = S 2 = 24 - S 3 = S 4 =,, S 1, S 2, S 3, S
14 b. c. S 1 = ( ) - 4 = 2.86 S 2 = 24 - [3(3.43) + 4(3.43)] = S 3 = = 1.43 S 4 = - ( ) = 7-14
15 n Introduction to Linear Programming 21. a. and b Constraint 2 5 Optimal Solution 4 Constraint 3 Constraint Feasible Region = c. Optimal solution occurs at the intersection of constraints 1 and 2. For constraint 2, = 1 + Substituting for in constraint 1 we obtain 5 + 5(1 + ) = = 4 1 = 35 = 35 = 1 + = = 45 Optimal solution is = 35, = 45 d. ecause the optimal solution occurs at the intersection of constraints 1 and 2, these are binding constraints. 7-15
16 e. Constraint 3 is the nonbinding constraint. t the optimal solution = 1(35) + 3(45) = 17. ecause 17 exceeds the right-hand side value of 9 by 8 units, there is a surplus of 8 associated with this constraint. 22. a. C Inspection and Packaging Cutting and Dyeing 15 4 Feasible Region 1 Sewing C = Number of ll-pro Footballs b. Extreme Point Coordinates Profit 1 (, ) 5() + 4() = 2 (17, ) 5(17) + 4() = 85 3 (14, 6) 5(14) + 4(6) = 94 4 (8, 12) 5(8) + 4(12) = 88 5 (, 168) 5() + 4(168) = 672 Extreme point 3 generates the highest profit. c. Optimal solution is = 14, C = 6 d. The optimal solution occurs at the intersection of the cutting and dyeing constraint and the inspection and packaging constraint. Therefore these two constraints are the binding constraints. e. New optimal solution is = 8, C = 12 Profit = 4(8) + 5(12) =
17 n Introduction to Linear Programming 23. a. Let E = number of units of the EZ-Rider produced L = number of units of the Lady-Sport produced Max 24E + 18L 6E + 3L 21 Engine time L 28 Lady-Sport maximum 2E + 2.5L 1 ssembly and testing E, L b. L 7 6 Engine Manufacturing Time Number of EZ-Rider Produced Frames for Lady-Sport Optimal Solution E = 25, L = 2 Profit = $96, 1 ssembly and Testing Number of Lady-Sport Produced E c. The binding constraints are the manufacturing time and the assembly and testing time. 24. a. Let R = number of units of regular model. C = number of units of catcher s model. Max 5R + 8C 1R + 3 /2 C 9 Cutting and sewing 1 /2 R + 1 /3 C 3 Finishing 1 /8 R + 1 /4 C 1 Packing and Shipping R, C 7-17
18 b. C 1 8 Catcher's Model 6 4 F C & S P & S Optimal Solution (5,15) Regular Model c. 5(5) + 8(15) = $3,7 R d. C & S 1(5) + 3 / 2 (15) = 725 F 1 / 2 (5) + 1 / 3 (15) = 3 P & S 1 / 8 (5) + 1 / 4 (15) = 1 e. Department Capacity Usage Slack C & S hours F 3 3 hours P & S 1 1 hours 25. a. Let = percentage of funds invested in the bond fund S = percentage of funds invested in the stock fund Max S.3 ond fund minimum S.75 Minimum return + S = 1 Percentage requirement b. Optimal solution: =.3, S =.7 Value of optimal solution is.88 or 8.8% 7-18
19 n Introduction to Linear Programming 26. a. a. Let N = amount spent on newspaper advertising R = amount spent on radio advertising b. Max 5N + 8R N + R = 1 udget N 25 Newspaper min. R 25 Radio min. N -2R News 2 Radio N, R R 1 Radio Min udget Optimal Solution N = , R = Value = 6, 5 N = 2 R Newspaper Min Feasible region is this line segment 5 1 N 27. Let I = Internet fund investment in thousands = lue Chip fund investment in thousands Max.12I +.9 1I vailable investment funds 1I 35 Maximum investment in the internet fund 6I Maximum risk for a moderate investor I, 7-19
20 6 Risk Constraint lue Chip Fund (s) Optimal Solution I = 2, = 3 $5,1 Maximum Internet Funds 2 1 Objective Function.12I +.9 vailable Funds $5, I Internet Fund (s) Internet fund $2, lue Chip fund $3, nnual return $ 5,1 b. The third constraint for the aggressive investor becomes 6I This constraint is redundant; the available funds and the maximum Internet fund investment constraints define the feasible region. The optimal solution is: Internet fund $35, lue Chip fund $15, nnual return $ 5,55 The aggressive investor places as much funds as possible in the high return but high risk Internet fund. c. The third constraint for the conservative investor becomes 6I This constraint becomes a binding constraint. The optimal solution is Internet fund $ lue Chip fund $4, nnual return $ 3,6 7-2
21 n Introduction to Linear Programming The slack for constraint 1 is $1,. This indicates that investing all $5, in the lue Chip fund is still too risky for the conservative investor. $4, can be invested in the lue Chip fund. The remaining $1, could be invested in low-risk bonds or certificates of deposit. 28. a. Let W = number of jars of Western Foods Salsa produced M = number of jars of Mexico City Salsa produced Max 1W M 5W 7M 448 Whole tomatoes 3W + 1M 28 Tomato sauce 2W + 2M 16 Tomato paste W, M Note: units for constraints are ounces b. Optimal solution: W = 56, M = 24 Value of optimal solution is a. Let = proportion of uffalo's time used to produce component 1 D = proportion of Dayton's time used to produce component 1 Maximum Daily Production Component 1 Component 2 uffalo 2 1 Dayton 6 14 Number of units of component 1 produced: 2 + 6D Number of units of component 2 produced: 1(1 - ) + 6(1 - D) For assembly of the ignition systems, the number of units of component 1 produced must equal the number of units of component 2 produced. Therefore, 2 + 6D = 1(1 - ) + 14(1 - D) 2 + 6D = D 3 + 2D = 24 Note: ecause every ignition system uses 1 unit of component 1 and 1 unit of component 2, we can maximize the number of electronic ignition systems produced by maximizing the number of units of subassembly 1 produced. Max 2 + 6D In addition, 1 and D
22 The linear programming model is: Max 2 + 6D 3 + 2D = 24 1 D 1, D The graphical solution is shown below. D D = D = 3 Optimal Solution Optimal Solution: =.8, D = Optimal Production Plan uffalo - Component 1.8(2) = 16 uffalo - Component 2.2(1) = 2 Dayton - Component 1 (6) = Dayton - Component 2 1(14) = 14 Total units of electronic ignition system = 16 per day. 7-22
23 n Introduction to Linear Programming 3. a. Let E = number of shares of Eastern Cable C = number of shares of ComSwitch Max 15E + 18C 4E + 25C 5, Maximum Investment 4E 15, Eastern Cable Minimum 25C 1, ComSwitch Minimum 25C 25, ComSwitch Maximum E, C b. C 2 Minimum Eastern Cable Number of Shares of ComSwitch 15 1 Maximum Comswitch Maximum Investment 5 Minimum Conswitch Number of Shares of Eastern Cable E c. There are four extreme points: (375,4); (1,4);(625,1); (375,1) d. Optimal solution is E = 625, C = 1 Total return = $27,
24 Feasible Region 2 Objective Function Value = Optimal Solution = 3, = = x 2 6 Minimum x 1 = Processing Time 4 (125,35) 3 Production 2 1 (125,225) (25,1) x
25 n Introduction to Linear Programming Extreme Points Objective Function Value Surplus Demand Surplus Total Production Slack Processing Time ( = 25, = 1) ( = 125, = 225) ( = 125, = 35) a. x x 1 Optimal Solution: = 3, = 1, value = 5 b. (1) 3 + 4(1) = 7 Slack = 21-7 = 14 (2) 2(3) + 1 = 7 Surplus = 7-7 = (3) 3(3) = 1.5 Slack = = 1.5 (4) -2(3) +6(1) = Surplus = - = 7-25
26 c. x x 1 Optimal Solution: = 6, = 2, value = a. 4 x Feasible Region (21/4, 9/4) 1 (4,1) b. There are two extreme points: ( = 4, = 1) and ( = 21/4, = 9/4) c. The optimal solution is = 4, = 1 6 x
27 n Introduction to Linear Programming 35. a. Min S 1 + S 2 + S S 1 = S 2 = S 3 = 4,, S 1, S 2, S 3 b. The optimal solution is = 6, = 4. c. S 1 = 4, S 2 =, S 3 =. 36. a. Let T = number of training programs on teaming P = number of training programs on problem solving Max 1,T + 8,P T 8 Minimum Teaming P 1 Minimum Problem Solving T + P 25 Minimum Total 3 T + 2 P 84 Days vailable T, P 7-27
28 b. P 4 Minimum Teaming Number of Problem-Solving Programs Minimum Total Days vailable Minimum Problem Solving T Number of Teaming Programs c. There are four extreme points: (15,1); (21.33,1); (8,3); (8,17) d. The minimum cost solution is T = 8, P = 17 Total cost = $216, 37. Regular Zesty Mild 8% 6% 81 Extra Sharp 2% 4% 3 Let R = number of containers of Regular Z = number of containers of Zesty Each container holds 12/16 or.75 pounds of cheese Pounds of mild cheese used =.8 (.75) R +.6 (.75) Z =.6 R +.45 Z Pounds of extra sharp cheese used =.2 (.75) R +.4 (.75) Z =.15 R +.3 Z 7-28
29 n Introduction to Linear Programming Cost of Cheese = Cost of mild + Cost of extra sharp = 1.2 (.6 R +.45 Z) (.15 R +.3 Z) =.72 R +.54 Z +.21 R +.42 Z =.93 R +.96 Z Packaging Cost =.2 R +.2 Z Total Cost = (.93 R +.96 Z) + (.2 R +.2 Z) = 1.13 R Z Revenue = 1.95 R Z Profit Contribution = Revenue - Total Cost = (1.95 R Z) - (1.13 R Z) =.82 R Z Max.82 R Z.6 R +.45 Z 81 Mild.15 R +.3 Z 3 Extra Sharp R, Z Optimal Solution: R = 96, Z = 52, profit =.82(96) + 1.4(52) = $13, a. Let S = yards of the standard grade material per frame P = yards of the professional grade material per frame Min 7.5S + 9.P.1S +.3P 6 carbon fiber (at least 2% of 3 yards).6s +.12P 3 kevlar (no more than 1% of 3 yards) S + P = 3 total (3 yards) S, P 7-29
30 b. 5 P Professional Grade (yards) total carbon fiber Extreme Point S = 15 P = 15 Extreme Point S = 1 P = 2 Feasible region is the line segment kevlar Standard Grade (yards) S c. Extreme Point Cost (15, 15) 7.5(15) + 9.(15) = (1, 2) 7.5(1) + 9.(2) = 255. The optimal solution is S = 15, P = 15 d. Optimal solution does not change: S = 15 and P = 15. However, the value of the optimal solution is reduced to 7.5(15) + 8(15) = $ e. t $7.4 per yard, the optimal solution is S = 1, P = 2. The value of the optimal solution is reduced to 7.5(1) + 7.4(2) = $223.. lower price for the professional grade will not change the S = 1, P = 2 solution because of the requirement for the maximum percentage of kevlar (1%). 39. a. Let S = number of units purchased in the stock fund M = number of units purchased in the money market fund Min 8S + 3M 5S + 1M 1,2, Funds available 5S + 4M 6, nnual income M 3, Minimum units in money market S, M, 7-3
31 . n Introduction to Linear Programming M x 2 Units of Money Market Fund x8S 1 + 3x 3M = 2 62, Optimal Solution x 1 S Units of Stock Fund Optimal Solution: S = 4, M = 1, value = 62 b. nnual income = 5(4) + 4(1) = 6, c. Invest everything in the stock fund. 4. Let P 1 = gallons of product 1 P 2 = gallons of product 2 Min 1P 1 + 1P 2 1P Product 1 minimum 1P 2 2 Product 2 minimum 1P 1 + 2P 2 8 Raw material P 1, P
32 P 2 8 Number of Gallons of Product P 1 +1P 2 = 55 (3,25) Feasible Region Use 8 gals Number of Gallons of Product 1 P 1 Optimal Solution: P 1 = 3, P 2 = 25 Cost = $ a. Let R = number of gallons of regular gasoline produced P = number of gallons of premium gasoline produced Max.3R +.5P.3R +.6P 18, Grade crude oil available 1R + 1P 5, Production capacity 1P 2, Demand for premium R, P 7-32
33 n Introduction to Linear Programming b. P 6, Gallons of Premium Gasoline 5, 4, 3, 2, 1, Production Capacity Maximum Premium Optimal Solution R = 4,, P = 1, $17, Grade Crude Oil R 1, 2, 3, 4, 5, 6, Optimal Solution: 4, gallons of regular gasoline 1, gallons of premium gasoline Total profit contribution = $17, Gallons of Regular Gasoline c. Constraint Value of Slack Variable Interpretation 1 ll available grade crude oil is used 2 Total production capacity is used 3 1, Premium gasoline production is 1, gallons less than the maximum demand d. Grade crude oil and production capacity are the binding constraints. 7-33
34 42. x Satisfies Constraint # Infeasibility 4 2 Satisfies Constraint # x x 2 3 Unbounded x a. 4 2 x 2 Objective Function Optimal Solution (3/16, 3/16) Value = 6/ x 1 b. New optimal solution is =, = 3, value =
35 n Introduction to Linear Programming 45. a. x Constraint #1 Feasible Region Constraint #2 4 2 Objective Function = x 1 Optimal Solution x 1 = 3, x 2 = Value = 3 b. Feasible region is unbounded. c. Optimal Solution: = 3, =, z = 3. d. n unbounded feasible region does not imply the problem is unbounded. This will only be the case when it is unbounded in the direction of improvement for the objective function. 46. Let N = number of sq. ft. for national brands G = number of sq. ft. for generic brands Problem Constraints: N + G 2 Space available N 12 National brands G 2 Generic 7-35
36 2 G Minimum National Shelf Space 1 Minimum Generic N 1 2 Extreme Point N G a. Optimal solution is extreme point 2; 18 sq. ft. for the national brand and 2 sq. ft. for the generic brand. b. lternative optimal solutions. ny point on the line segment joining extreme point 2 and extreme point 3 is optimal. c. Optimal solution is extreme point 3; 12 sq. ft. for the national brand and 8 sq. ft. for the generic brand. 7-36
37 n Introduction to Linear Programming x 2 5 Processing Time (125,225) lternate optima 1 (25,1) x 1 lternative optimal solutions exist at extreme points ( = 125, = 225) and ( = 25, = 1). or Cost = 3(125) + 3(225) = 15 Cost = 3(25) + 3(1) = 15 The solution ( = 25, = 1) uses all available processing time. However, the solution ( = 125, = 225) uses only 2(125) + 1(225) = 475 hours. Thus, ( = 125, = 225) provides = 125 hours of slack processing time which may be used for other products. 7-37
38 Feasible solutions for constraint requiring 5 gallons of production Original Feasible Solution Possible ctions: i. Reduce total production to = 125, = 35 on 475 gallons. ii. Make solution = 125, = 375 which would require 2(125) + 1(375) = 625 hours of processing time. This would involve 25 hours of overtime or extra processing time. iii. Reduce minimum production to 1, making = 1, = 4 the desired solution. 49. a. Let P = number of full-time equivalent pharmacists T = number of full-time equivalent physicians The model and the optimal solution obtained using The Management Scientist is shown below: MIN 4P+1T S.T. 1) 1P+1T>25 2) 2P-1T> 3) 1P>9 OPTIML SOLUTION Objective Function Value = 52. Variable Value Reduced Costs P 9.. T
39 n Introduction to Linear Programming Constraint Slack/Surplus Dual Prices The optimal solution requires 9 full-time equivalent pharmacists and 16 full-time equivalent technicians. The total cost is $52 per hour. b. Current Levels ttrition Optimal Values New Hires Required Pharmacists Technicians The payroll cost using the current levels of 85 pharmacists and 175 technicians is 4(85) + 1(175) = $515 per hour. The payroll cost using the optimal solution in part (a) is $52 per hour. Thus, the payroll cost will go up by $5 5. Let M = number of Mount Everest Parkas R = number of Rocky Mountain Parkas Max 1M + 15R 3M + 2R 72 Cutting time 45M + 15R 72 Sewing time.8m -.2R % requirement Note: Students often have difficulty formulating constraints such as the % requirement constraint. We encourage our students to proceed in a systematic step-by-step fashion when formulating these types of constraints. For example: M must be at least 2% of total production M.2 (total production) M.2 (M + R) M.2M +.2R.8M -.2R 7-39
40 R 5 Sewing 4 % Requirement 3 Optimal Solution (65.45,261.82) 2 1 Cutting Profit = $3, M The optimal solution is M = and R = ; the value of this solution is z = 1(65.45) + 15(261.82) = $45,818. If we think of this situation as an on-going continuous production process, the fractional values simply represent partially completed products. If this is not the case, we can approximate the optimal solution by rounding down; this yields the solution M = 65 and R = 261 with a corresponding profit of $45, Let C = number sent to current customers N = number sent to new customers Note: Number of current customers that test drive =.25 C Number of new customers that test drive =.2 N Number sold =.12 (.25 C ) +.2 (.2 N ) =.3 C +.4 N Max.3C +.4N.25 C 3, Current Min.2 N 1, New Min.25 C -.4 N Current vs. New 4 C + 6 N 1,2, udget C, N, 7-4
41 n Introduction to Linear Programming N Current Min. 2, udget Current 2 New 1,.3C +.4N = 6 Optimal Solution C = 225,, N = 5, Value = 8,75 New Min. 1, 2, 3, C 52. Let S = number of standard size rackets O = number of oversize size rackets Max 1S + 15O.8S -.2O % standard 1S + 12O 48 Time.125S +.4O 8 lloy - S, O, 5 O % Requirement Time Optimal Solution (384,8) lloy S
42 53. a. Let R = time allocated to regular customer service N = time allocated to new customer service Max 1.2R + N R + N 8 25R + 8N 8 -.6R + N b. OPTIML SOLUTION R, N, Objective Function Value = 9. Variable Value Reduced Costs R 5.. N 3.. Constraint Slack/Surplus Dual Prices Optimal solution: R = 5, N = 3, value = 9 HTS should allocate 5 hours to service for regular customers and 3 hours to calling on new customers. 54. a. Let M 1 = number of hours spent on the M-1 machine M 2 = number of hours spent on the M-2 machine Total Cost 6(4)M 1 + 6(5)M 2 + 5M M 2 = 29M M 2 Total Revenue 25(18)M 1 + 4(18)M 2 = 45M M 2 Profit Contribution (45-29)M 1 + (72-375)M 2 = 16M M
43 n Introduction to Linear Programming Max 16 M M 2 M 1 15 M-1 maximum M 2 1 M-2 maximum M 1 5 M-1 minimum M 2 5 M-2 minimum 4 M M 2 1 Raw material available M 1, M 2 b. OPTIML SOLUTION Objective Function Value = 545. Variable Value Reduced Costs M M2 1.. Constraint Slack/Surplus Dual Prices The optimal decision is to schedule 12.5 hours on the M-1 and 1 hours on the M
Homework #2 Graphical LP s.
UNIVERSITY OF MASSACHUSETTS Isenberg School of Management Department of Finance and Operations Management FOMGT 353-Introduction to Management Science Homework #2 Graphical LP s. Show your work completely
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 informationChapter Two: Linear Programming: Model Formulation and Graphical Solution
Chapter Two: Linear Programming: Model Formulation and Graphical Solution PROBLEM SUMMARY 1. Maximization (1 28 continuation), graphical solution 2. Minimization, graphical solution 3. Sensitivity analysis
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 informationLinear Programming: Exercises
Linear Programming: Exercises 1. The Holiday Meal Turkey Ranch is considering buying two different brands of turkey feed and blending them to provide a good, low-cost diet for its turkeys. Each brand of
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 Two: Linear Programming: Model Formulation and Graphical Solution
TYLM0_0393.QX //09 :3 M Page hapter Two: Linear Programming: Model Formulation and Graphical Solution PROLEM SUMMRY. Maimization ( continuation), graphical solution. Maimization, graphical solution 3.
More informationSolving Examples of Linear Programming Models
Solving Examples of Linear Programming Models Chapter 4 Copyright 2013 Pearson Education 4-1 Chapter Topics 1. A Product Mix Example 2. A Diet Example 3. An Investment Example 4. A Marketing Example 5.
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 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 informationChapter Two: Linear Programming: Model Formulation and Graphical Solution
hapter Two: Linear Programming: Model Formulation and Graphical Solution PROLEM SUMMRY. Maimization ( continuation), graphical solution. Maimization, graphical solution 3. Minimization, graphical solution.
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 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 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 informationAssignment 2 Answers Introduction to Management Science 2003
Assignment Answers Introduction to Management Science 00. a. Top management will need to know how much to produce in each quarter. Thus, the decisions are the production levels in quarters,,, and. The
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 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 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 informationDO NOT WRITE RATIOS AS MIXED NUMBERS. NOTE THAT THE ORDER MATTERS.
Math 20 Arithmetic Sec 5.1: Ratios Defn A ratio compares two quantities that have the same type of units. A rate compares two quantities with different units. Ex Suppose the ratio of your monthly expenses
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 informationThe homework is due on Wednesday, September 7. Each questions is worth 0.8 points. No partial credits.
Homework : Econ500 Fall, 0 The homework is due on Wednesday, September 7. Each questions is worth 0. points. No partial credits. For the graphic arguments, use the graphing paper that is attached. Clearly
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 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 informationProduct Mix Problem: Fifth Avenue Industries. Linear Programming (LP) Can Be Used for Many Managerial Decisions:
Linear Programming (LP) Can Be Used for Many Managerial Decisions: Product mix Make-buy Media selection Marketing research Portfolio selection Shipping & transportation Multiperiod scheduling For a particular
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 informationSetting Up Linear Programming Problems
Setting Up Linear Programming Problems A company produces handmade skillets in two sizes, big and giant. To produce one big skillet requires 3 lbs of iron and 6 minutes of labor. To produce one giant skillet
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 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 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 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 informationIntroduction 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 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 informationHomework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution.
Homework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution. Graphical Solution is attached to email. Lindo The results of the Wilson
More informationOperation Research II
Operation Research II Johan Oscar Ong, ST, MT Grading Requirements: Min 80% Present in Class Having Good Attitude Score/Grade : Quiz and Assignment : 30% Mid test (UTS) : 35% Final Test (UAS) : 35% No
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 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 informationMgtOp 470 Business Modeling with Spreadsheets Washington State University Sample Final Exam
MgtOp 470 Business Modeling with Spreadsheets Washington State University Sample Final Exam Section 1 Multiple Choice 1. An information desk at a rest stop receives requests for assistance (from one server).
More informationSetting Up Linear Programming Problems
Setting Up Linear Programming Problems A company produces handmade skillets in two sizes, big and giant. To produce one big skillet requires 3 lbs of iron and 6 minutes of labor. To produce one giant skillet
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 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 informationTEST TWO QUANTITATIVE METHODS BSTA 450 March 17, 2003
TEST TWO QUANTITATIVE METHODS BSTA 450 March 17, 2003 Name:(Print neatly) Student Number: -Put all your solutions on the paper provided. -make sure you READ the question and provide the solution it asks
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 informationChapter 21. Dynamic Programming CONTENTS 21.1 A SHORTEST-ROUTE PROBLEM 21.2 DYNAMIC PROGRAMMING NOTATION
Chapter 21 Dynamic Programming CONTENTS 21.1 A SHORTEST-ROUTE PROBLEM 21.2 DYNAMIC PROGRAMMING NOTATION 21.3 THE KNAPSACK PROBLEM 21.4 A PRODUCTION AND INVENTORY CONTROL PROBLEM 23_ch21_ptg01_Web.indd
More informationOperations Research I: Deterministic Models
AMS 341 (Spring, 2009) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, March 12, 2009 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
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 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 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 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 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 informationConsumers cannot afford all the goods and services they desire. Consumers are limited by their income and the prices of goods.
Budget Constraint: Review Consumers cannot afford all the goods and services they desire. Consumers are limited by their income and the prices of goods. Model Assumption: Consumers spend all their income
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 informationPart 1 Examination Paper 1.2. Section A 10 C 11 C 2 A 13 C 1 B 15 C 6 C 17 B 18 C 9 D 20 C 21 C 22 D 23 D 24 C 25 C
Answers Part 1 Examination Paper 1.2 Financial Information for Management June 2007 Answers Section A 1 B 2 A 3 A 4 A 5 D 6 C 7 B 8 C 9 D 10 C 11 C 12 A 13 C 14 B 15 C 16 C 17 B 18 C 19 D 20 C 21 C 22
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 informationCSCI 1951-G Optimization Methods in Finance Part 07: Portfolio Optimization
CSCI 1951-G Optimization Methods in Finance Part 07: Portfolio Optimization March 9 16, 2018 1 / 19 The portfolio optimization problem How to best allocate our money to n risky assets S 1,..., S n with
More informationCHAPTER 21 (FIN MAN); CHAPTER 6 (MAN) BUDGETING
CHAPTER 21 (FIN MAN); CHAPTER 6 (MAN) BUDGETING Number Objective Description Difficulty Time AACSB IMA SS GL EO21(6)-1 21-1 Easy 5 min Analytic Budget Preparation EO21(6)-2 21-1 Easy 5 min Analytic Budget
More informationOptimization Modeling in Spreadsheets. with. What sbest!
Optimization Modeling in Spreadsheets with What sbest! 2013 LINDO Systems January 2013 Preliminary version, comments welcome. Published by 1415 North Dayton Street Chicago, Illinois 60622 Technical Support:
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 informationName Period. Linear Correlation
Linear Regression Models Directions: Use the information below to solve the problems in this packet. Packets are due at the end of the period and students who do not finish will be required to come in
More informationWeek 6: Sensitive Analysis
Week 6: Sensitive Analysis 1 1. Sensitive Analysis Sensitivity Analysis is a systematic study of how, well, sensitive, the solutions of the LP are to small changes in the data. The basic idea is to be
More informationMidterm 2 Example Questions
Midterm Eample Questions Solve LPs using Simple. Consider the following LP:, 6 ma (a) Convert the LP to standard form.,,, 6 ma (b) Starting with and as nonbasic variables, solve the problem using the Simple
More informationFill-in-the-Blank Equations. Exercises
Chapter 26 Cost Allocation and Activity-Based Costing Study Guide Solutions Fill-in-the-Blank Equations 1. Total budgeted plantwide allocation base 2. Department factory overhead rate 3. Ratio of allocation
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 informationCHAPTER 13 BUDGETING AND STANDARD COST SYSTEMS
CHAPTER 13 BUDGETING AND STANDARD COST SYSTEMS CLASS DISCUSSION QUESTIONS 1. The three major objectives of budgeting are (1) to establish specific goals for future operations, (2) to direct and coordinate
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 informationPaper F2. Management Accounting. Fundamentals Pilot Paper Knowledge module. The Association of Chartered Certified Accountants. Time allowed: 2 hours
Fundamentals Pilot Paper Knowledge module Management ccounting Time allowed: 2 hours LL FIFTY questions are compulsory and MUST be attempted. Paper F2 o NOT open this paper until instructed by the supervisor.
More informationQuestion #1: Snacks and foods that will be part of my low cost diet: Table 1: Nutritional information Description Milk 1% fat with calcium added (250 ml) 1 2 3 4 5 6 7 8 9 10 30 g Appletropical 2 slices
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 informationLinear Programming. There are 5 main steps to solving a Linear Programming problem:
Linear Programming Linear Programming is actually one of the most useful topics in math because it is a simple model for problems with limited resources. Many large companies, even the military, use linear
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 informationECO 301 MACROECONOMIC THEORY UNIVERSITY OF MIAMI DEPARTMENT OF ECONOMICS FALL 2008 Instructor: Dr. S. Nuray Akin MIDTERM EXAM I
ECO 301 MACROECONOMIC THEORY UNIVERSITY OF MIAMI DEPARTMENT OF ECONOMICS FALL 2008 Instructor: Dr. S. Nuray Akin MIDTERM EXAM I Name: Section: Instructions: This exam consists of 6 pages; please check
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 informationEastern Mediterranean University Faculty of Business and Economics Department of Economics Fall Semester. ECON 101 Mid term Exam
Eastern Mediterranean University Faculty of Business and Economics Department of Economics 2014 15 Fall Semester ECON 101 Mid term Exam Suggested Solutions 28 November 2014 Duration: 90 minutes Name Surname:
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 informationNon-negativity: negativity:
Chapter 3 Linear Programming Applications The process of problem formulation Marketing and media applications Financial Applications Transportation Problem The process of problem formulation 1. Provide
More informationwhere Qs is the quantity supplied, Qd is the quantity demanded, and P is the price.
Economics 101 Spring 2015 Homework #3 Due March 19, 2015 Directions: The homework will be collected in a box before the lecture. Please place your name on top of the homework (legibly). Make sure you write
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 informationLinear Modeling Business 5 Supply and Demand
Linear Modeling Business 5 Supply and Demand Supply and demand is a fundamental concept in business. Demand looks at the Quantity (Q) of a product that will be sold with respect to the Price (P) the product
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming Dynamic programming is a technique that can be used to solve many optimization problems. In most applications, dynamic programming obtains solutions by working backward
More informationChapter 4 UTILITY MAXIMIZATION AND CHOICE
Chapter 4 UTILITY MAXIMIZATION AND CHOICE 1 Our Consumption Choices Suppose that each month we have a stipend of $1250. What can we buy with this money? 2 What can we buy with this money? Pay the rent,
More informationx x x1
Mathematics for Management Science Notes 08 prepared by Professor Jenny Baglivo Graphical representations As an introduction to the calculus of two-variable functions (f(x ;x 2 )), consider two graphical
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 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 informationActivity Predecessors Durations (days) a - 3 b a 4 c a 5 d a 4 e b 2 f d 9 g c, e 6 h f, g 2
CHAPTER 11 INDUSTRIAL ENGINEERING YEAR 2012 ONE MARK MCQ 11.1 Which one of the following is NOT a decision taken during the aggregate production planning stage? (A) Scheduling of machines (B) Amount of
More informationOptimizing the service of the Orange Line
Optimizing the service of the Orange Line Overview Increased crime rate in and around campus Shuttle-UM Orange Line 12:00am 3:00am late night shift A student standing or walking on and around campus during
More informationPaper 1.2. Financial Information for Management PART 1 FRIDAY 10 DECEMBER 2004 QUESTION PAPER. Time allowed 3 hours
Financial Information for Management PRT 1 FRIY 10 EEMER 2004 QUESTION PPER Time allowed 3 hours This paper is divided into two sections Section LL 25 questions are compulsory and MUST be answered Paper
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 informationMath 1090 Final Exam Fall 2012
Math 1090 Final Exam Fall 2012 Name Instructor: Student ID Number: Instructions: Show all work, as partial credit will be given where appropriate. If no work is shown, there may be no credit given. All
More informationMath Models of OR: More on Equipment Replacement
Math Models of OR: More on Equipment Replacement John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA December 2018 Mitchell More on Equipment Replacement 1 / 9 Equipment replacement
More informationMath Fundamentals for Statistics (Math 52) Homework Unit 6: Rates/Ratios/Proportions. Scott Fallstrom and Brent Pickett The How and Whys Guys
Math Fundamentals for Statistics (Math 52) Homework Unit 6: Rates/Ratios/Proportions Scott Fallstrom and Brent Pickett The How and Whys Guys Homework Unit 6 Page 1 6.1: Comparing Objects Ratios and Rates
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 informationInstantaneous rate of change (IRC) at the point x Slope of tangent
CHAPTER 2: Differentiation Do not study Sections 2.1 to 2.3. 2.4 Rates of change Rate of change (RC) = Two types Average rate of change (ARC) over the interval [, ] Slope of the line segment Instantaneous
More informationName: Class: Date: in general form.
Write the equation in general form. Mathematical Applications for the Management Life and Social Sciences 11th Edition Harshbarger TEST BANK Full clear download at: https://testbankreal.com/download/mathematical-applications-management-life-socialsciences-11th-edition-harshbarger-test-bank/
More informationNODIA AND COMPANY. GATE SOLVED PAPER Mechanical Engineering Industrial Engineering. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Mechanical
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 informationy > 2x! 4 0 > 2(0)! 4
y > 2x! 4 0 > 2(0)! 4? 0 >!4 y 6 4 2-10 -5 5 10 x -2-4 -6 y! " 1 3 x + 3 y 6 0! 3 4 2-10 -5 5 10 x -2-4 -6 y > 2x! 4 0 >? 2(0)! 4 0 >!4 y 6 y! " 1 3 x + 3 0! 3 4 2-10 -5 5 10 x -2-4 -6 Linear Programming
More informationChapter 6. Production. Introduction. Production Decisions of a Firm. Production Decisions of a Firm
Chapter 6 Production Introduction Our study of consumer behavior was broken down into 3 steps Describing consumer preferences Consumers face budget constraints Consumers choose to maximize utility Production
More informationEcon Homework 4 - Answers ECONOMIC APPLICATIONS OF CONSTRAINED OPTIMIZATION. 1. Assume that a rm produces product x using k and l, where
Econ 4808 - Homework 4 - Answers ECONOMIC APPLICATIONS OF CONSTRAINED OPTIMIZATION Graded questions: : A points; B - point; C - point : B points : B points. Assume that a rm produces product x using k
More informationLecture 2. A Telephone Staffing Problem TransportCo Distribution Problem Shelby Shelving Case Summary and Preparation for next class
Decision Models Lecture 2 1 Lecture 2 A Telephone Staffing Problem TransportCo Distribution Problem Shelby Shelving Case Summary and Preparation for next class Decision Models Lecture 2 2 A Telephone Staffing
More informationNote 1: Indifference Curves, Budget Lines, and Demand Curves
Note 1: Indifference Curves, Budget Lines, and Demand Curves Jeff Hicks September 19, 2017 Vancouver School of Economics, University of British Columbia In this note, I show how indifference curves and
More informationLecture 10: The knapsack problem
Optimization Methods in Finance (EPFL, Fall 2010) Lecture 10: The knapsack problem 24.11.2010 Lecturer: Prof. Friedrich Eisenbrand Scribe: Anu Harjula The knapsack problem The Knapsack problem is a problem
More information