Chapter 2 An Introduction to Linear Programming
|
|
- Darlene Long
- 5 years ago
- Views:
Transcription
1 Chapter 2 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 2-1
2 Chapter 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) 2-3
4 Chapter 2 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 = 42 is labeled (a) = 42 is labeled (b) = 42 is labeled (c) 1 8 (c) 6 4 (b) 2 (a)
6 Chapter / 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 2-7
8 Chapter = 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,) 2-8
9 n Introduction to Linear Programming b. 3 Optimal Solution =, = 3 Value of Objective Function = (,) a. c. There are four extreme points: (,), (4,), (3,1,5), and (,3) Feasible Region consists of this line segment only b. The extreme points are (5, 1) and (2, 4). 2-9
10 Chapter 2 c Optimal Solution = 2, = a. Let F = number of tons of fuel additive S = number of tons of solvent base Max 4F + 3S 2/5F + 1 /2 S 2 Material 1 1 /5 S 5 Material 2 3 /5 F + 3 /1 S 21 Material 3 F, S 2-1
11 n Introduction to Linear Programming b. S F 15. a. c. Material 2: 4 tons are used, 1 ton is unused. d. No redundant constraints. 2-11
12 Chapter 2 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) = a. Max S 1 + S 2 + S S 1 = S 2 = S 3 = 125,, S 1, S 2, S 3 Max S 1 + S 2 + S S 1 = S 2 = S 3 = 1,, S 1, S 2, S
13 n Introduction to Linear Programming b 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
14 Chapter 2 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
15 n Introduction to Linear Programming b. c. S 1 = ( ) - 4 = 2.86 S 2 = 24 - [3(3.43) + 4(3.43)] = S 3 = = 1.43 S 4 = - ( ) = 2-15
16 Chapter 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. 2-16
17 n Introduction to Linear Programming 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) =
18 Chapter 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 R, C 1 /2 R + 1 /3 C 3 Finishing 1 /8 R + 1 /4 C 1 Packing and Shipping 2-18
19 . Catcher's Model n Introduction to Linear Programming b. C 1 8 F 6 4 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% 2-19
20 Chapter 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, 2-2
21 n Introduction to Linear Programming 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 2-21
22 Chapter 2 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
23 n Introduction to Linear Programming The linear programming model is: Max 2 + 6D 3 + 2D = 24 1 D 1, D The graphical solution is shown below. 1.2 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. 2-23
24 Chapter 2 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 Maximum Comswitch Maximum Investment 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,
25 n Introduction to Linear Programming Feasible Region 2 Objective Function Value = Optimal Solution = 3, = =
26 Chapter a. Extreme Points Objective Function Value Surplus Demand Surplus Total Production Slack Processing Time ( = 25, = 1) ( = 125, = 225) ( = 125, = 35) 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 = - = 2-26
27 n Introduction to Linear Programming c. Optimal Solution: = 6, = 2, value = a. 4 x Feas ible 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
28 Chapter 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 2-28
29 n Introduction to Linear Programming b. P 4 Minimum Teaming Number of Problem-Solving Programs Minimum Total Days vailable Minimum Problem Solving 1 2 Number of Teaming Programs 3 T 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 2-29
30 Chapter 2 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 2-3
31 n Introduction to Linear Programming 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, 2-31
32 Units of Money Market Fund Chapter 2 M x 2 2 8x8S 1 + 3x 3M = 2 62, 15 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
33 n Introduction to Linear Programming 8 P 2 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 2-33
34 Chapter 2 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. 2-34
35 n Introduction to Linear Programming 42. x Satis fies Constraint # Infeas ibility 4 2 Satis fies 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 =
36 Chapter a. 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 2-36
37 n Introduction to Linear Programming 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. 2-37
38 Chapter 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. 2-38
39 n Introduction to Linear Programming 48. 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 are shown below: MIN 4P+1T S.T. 1) P+T >=25 2) 2P-T>= 3) P>=9 Optimal Objective Value 52. Variable Value Reduced Cost P 9.. T
40 Chapter 2 Constraint Slack/Surplus Dual Value 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 2-4
41 n Introduction to Linear Programming 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, 2-41
42 Chapter 2 2, N udget Current Min. 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, 2-42
43 n Introduction to Linear Programming 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 R, N, b. Optimal Objective Value 9. Variable Value Reduced Cost R 5.. N 3.. Constraint Slack/Surplus Dual Value 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
44 Chapter 2 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. Optimal Objective Value 545. Variable Value Reduced Cost M M Constraint Slack/Surplus Dual Value The optimal decision is to schedule 12.5 hours on the M-1 and 1 hours on the M Mr. Krtick s solution cannot be optimal. Every department has unused hours, so there are no binding constraints. With unused hours in every department, clearly some more product can be made. 56. No, it is not possible that the problem is now infeasible. Note that the original problem was feasible (it had an optimal solution). Every solution that was feasible is still feasible when we change the constraint to lessthan-or-equal-to, since the new constraint is satisfied at equality (as well as inequality). In summary, we have relaxed the constraint so that the previous solutions are feasible (and possibly more satisfying the constraint as strict inequality). 57. Yes, it is possible that the modified problem is infeasible. To see this, consider a redundant greater-thanor-equal to constraint as shown below. Constraints 2,3, and 4 form the feasible region and constraint 1 is redundant. Change constraint 1 to less-than-or-equal-to and the modified problem is infeasible. 2-44
45 n Introduction to Linear Programming Original Problem: Modified Problem: 58. It makes no sense to add this constraint. The objective of the problem is to minimize the number of products needed so that everyone s top three choices are included. There are only two possible outcomes relative to the boss new constraint. First, suppose the minimum number of products is <= 15, then there was no need for the new constraint. Second, suppose the minimum number is > 15. Then the new constraint makes the problem infeasible. 2-45
2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More informationGraphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna 2008 Prentice-Hall, Inc. Introduction Many management
More informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More informationAn Introduction to Linear Programming
An Introduction to Linear Programming Linear Programming Problem Problem Formulation A Maximization Problem Graphical Solution Procedure Extreme Points and the Optimal Solution Computer Solutions A Minimization
More informationCHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming CHAPTER 11 253 CHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming TRUE/FALSE 11.1 If conditions require that all
More information42 Average risk. Profit = (8 5)x 1 é ù. + (14 10)x 3
CHAPTER 2 1. Let x 1 and x 2 be the output of P and V respectively. The LPP is: Maximise Z = 40x 1 + 30x 2 Profit Subject to 400x 1 + 350x 2 250,000 Steel 85x 1 + 50x 2 26,100 Lathe 55x 1 + 30x 2 43,500
More informationChapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek
Chapter 3 Introduction to Linear Programming PART 1 Assoc. Prof. Dr. Arslan M. Örnek http://homes.ieu.edu.tr/~aornek/ise203%20optimization%20i.htm 1 3.1 What Is a Linear Programming Problem? Linear Programming
More informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More informationThe Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1
The Graphical Method & Algebraic Technique for Solving LP s Métodos Cuantitativos M. En C. Eduardo Bustos Farías The Graphical Method for Solving LP s If LP models have only two variables, they can be
More informationLP Definition and Introduction to Graphical Solution Active Learning Module 2
LP Definition and Introduction to Graphical Solution Active Learning Module 2 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Background Material
More informationLinear Programming CHAPTER 11 BASIC CONCEPTS AND FORMULA. Basic Concepts 1. Linear Programming
CHAPTER 11 Linear Programming Basic Concepts 1. Linear Programming BASIC CONCEPTS AND FORMULA Linear programming is a mathematical technique for determining the optimal allocation of re- sources nd achieving
More informationLinear Programming. Businesses seek to maximize their profits while operating under budget, supply, Chapter
Chapter 4 Linear Programming Businesses seek to maximize their profits while operating under budget, supply, labor, and space constraints. Determining which combination of variables will result in the
More informationUNIT-4 Chapter6 Linear Programming
UNIT-4 Chapter6 Linear Programming Linear Programming 6.1 Introduction Operations Research is a scientific approach to problem solving for executive management. It came into existence in England during
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form Graphical representation
More informationLINEAR PROGRAMMING BASIC CONCEPTS AND FORMULA
CHAPTER 11 LINEAR PROGRAMMING Basic Concepts 1. Linear Programming BASIC CONCEPTS AND FORMULA Linear programming is a mathematical technique for determining the optimal allocation of re- sources nd achieving
More informationChapter 2 Introduction to Optimization and Linear Programming
Ch. 2 Introduction to Optimization and Linear Programming TB-9 Chapter 2 Introduction to Optimization and Linear Programming Multiple Choice 1. What most motivates a business to be concerned with efficient
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
More informationChapter 4. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 4-1
Linear Programming: Modeling Examples Chapter 4 4-1 Chapter Topics A Product Mix Example A Diet Example An Investment Example A Marketing Example A Transportation Example A Blend Example A Multiperiod
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 (First Group of Students) Students with first letter of surnames A F Due: February 12, 2013 1. Each student
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
More informationSELECT TWO PROBLEMS (OF A POSSIBLE FOUR) FROM PART ONE, AND FOUR PROBLEMS (OF A POSSIBLE FIVE) FROM PART TWO. PART ONE: TOTAL GRAND
1 56:270 LINEAR PROGRAMMING FINAL EXAMINATION - MAY 17, 1985 SELECT TWO PROBLEMS (OF A POSSIBLE FOUR) FROM PART ONE, AND FOUR PROBLEMS (OF A POSSIBLE FIVE) FROM PART TWO. PART ONE: 1 2 3 4 TOTAL GRAND
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 (Second Group of Students) Students with first letter of surnames G Z Due: February 12, 2013 1. Each
More informationThe Simplex Algorithm and Goal Programming
The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is
More informationSolution Cases: 1. Unique Optimal Solution Reddy Mikks Example Diet Problem
Solution Cases: 1. Unique Optimal Solution 2. Alternative Optimal Solutions 3. Infeasible solution Case 4. Unbounded Solution Case 5. Degenerate Optimal Solution Case 1. Unique Optimal Solution Reddy Mikks
More informationLinear programming: introduction and examples
Linear programming: introduction and examples G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Linear
More informationLinear Programming: The Simplex Method
7206 CH09 GGS /0/05 :5 PM Page 09 9 C H A P T E R Linear Programming: The Simplex Method TEACHING SUGGESTIONS Teaching Suggestion 9.: Meaning of Slack Variables. Slack variables have an important physical
More informationPractice Questions for Math 131 Exam # 1
Practice Questions for Math 131 Exam # 1 1) A company produces a product for which the variable cost per unit is $3.50 and fixed cost 1) is $20,000 per year. Next year, the company wants the total cost
More informationModern Logistics & Supply Chain Management
Modern Logistics & Supply Chain Management As gold which he cannot spend will make no man rich, so knowledge which he cannot apply will make no man wise. Samuel Johnson: The Idler No. 84 Production Mix
More information9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS
SECTION 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS 557 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS In Sections 9. and 9., you looked at linear programming problems that occurred in standard form. The constraints
More informationNATIONAL OPEN UNIVERSITY OF NIGERIA SCHOOL OF SCIENCE AND TECHNOLOGY COURSE CODE: MTH 309 COURSE TITLE: OPTIMIZATION THEORY
NATIONAL OPEN UNIVERSITY OF NIGERIA SCHOOL OF SCIENCE AND TECHNOLOGY COURSE CODE: MTH 39 COURSE TITLE: OPTIMIZATION THEORY MTH 39 OPTIMIZATION THEORY Prof. U. A. Osisiogu August 28, 22 CONTENTS I 7 Linear
More informationMATH 445/545 Test 1 Spring 2016
MATH 445/545 Test Spring 06 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 545 level. Please read and follow all of these
More informationThe Transportation Problem
CHAPTER 12 The Transportation Problem Basic Concepts 1. Transportation Problem: BASIC CONCEPTS AND FORMULA This type of problem deals with optimization of transportation cost in a distribution scenario
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
More informationChapter 5 Integer Programming
Chapter 5 Integer Programming Chapter Topics Integer Programming (IP) Models Integer Programming Graphical Solution Computer Solution of Integer Programming Problems With Excel 2 1 Integer Programming
More informationMATH 445/545 Homework 1: Due February 11th, 2016
MATH 445/545 Homework 1: Due February 11th, 2016 Answer the following questions Please type your solutions and include the questions and all graphics if needed with the solution 1 A business executive
More informationStudy Unit 3 : Linear algebra
1 Study Unit 3 : Linear algebra Chapter 3 : Sections 3.1, 3.2.1, 3.2.5, 3.3 Study guide C.2, C.3 and C.4 Chapter 9 : Section 9.1 1. Two equations in two unknowns Algebraically Method 1: Elimination Step
More informationDoug Clark The Learning Center 100 Student Success Center learningcenter.missouri.edu Overview
Math 1400 Final Exam Review Saturday, December 9 in Ellis Auditorium 1:00 PM 3:00 PM, Saturday, December 9 Part 1: Derivatives and Applications of Derivatives 3:30 PM 5:30 PM, Saturday, December 9 Part
More informationOptimisation. 3/10/2010 Tibor Illés Optimisation
Optimisation Lectures 3 & 4: Linear Programming Problem Formulation Different forms of problems, elements of the simplex algorithm and sensitivity analysis Lecturer: Tibor Illés tibor.illes@strath.ac.uk
More informationChapter 1: Linear Equations and Functions
Chapter : Answers to Eercises Chapter : Linear Equations and Functions Eercise.. 7= 8+ 7+ 7 8 = 8+ + 7 8 = 9. + 8= 8( + ). + 8= 8+ 8 8 = 8 8 7 = 0 = 0 9 = = = () = 96 = 7. ( 7) = ( + ) 9.. = + + = + =
More information36106 Managerial Decision Modeling Linear Decision Models: Part II
1 36106 Managerial Decision Modeling Linear Decision Models: Part II Kipp Martin University of Chicago Booth School of Business January 20, 2014 Reading and Excel Files Reading (Powell and Baker): Sections
More informationChapter 1 Linear Equations
. Lines. True. True. If the slope of a line is undefined, the line is vertical. 7. The point-slope form of the equation of a line x, y is with slope m containing the point ( ) y y = m ( x x ). Chapter
More information56:270 Final Exam - May
@ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the
More informationSection 4.1 Solving Systems of Linear Inequalities
Section 4.1 Solving Systems of Linear Inequalities Question 1 How do you graph a linear inequality? Question 2 How do you graph a system of linear inequalities? Question 1 How do you graph a linear inequality?
More informationInteger Programming. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Integer Programming Chapter 5 5-1 Chapter Topics Integer Programming (IP) Models Integer Programming Graphical Solution Computer Solution of Integer Programming Problems With Excel and QM for Windows 0-1
More informationDecision Models Lecture 5 1. Lecture 5. Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class
Decision Models Lecture 5 1 Lecture 5 Foreign-Currency Trading Integer Programming Plant-location example Summary and Preparation for next class Foreign Exchange (FX) Markets Decision Models Lecture 5
More informationLINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION
Name: LINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION In general, a mathematical model is either deterministic or probabilistic. For example, the models and algorithms shown in the Graph-Optimization
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
More information3E4: Modelling Choice
3E4: Modelling Choice Lecture 6 Goal Programming Multiple Objective Optimisation Portfolio Optimisation Announcements Supervision 2 To be held by the end of next week Present your solutions to all Lecture
More information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
More informationLINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.
3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.4 Sensitivity Analysis Copyright Cengage Learning. All rights reserved. Sensitivity Analysis In this section,
More informationTheoretical questions and problems to practice Advanced Mathematics and Statistics (MSc course)
Theoretical questions and problems to practice Advanced Mathematics and Statistics (MSc course) Faculty of Business Administration M.Sc. English, 2015/16 first semester Topics (1) Complex numbers. Complex
More informationUNIVERSITY OF KWA-ZULU NATAL
UNIVERSITY OF KWA-ZULU NATAL EXAMINATIONS: June 006 Solutions Subject, course and code: Mathematics 34 MATH34P Multiple Choice Answers. B. B 3. E 4. E 5. C 6. A 7. A 8. C 9. A 0. D. C. A 3. D 4. E 5. B
More informationDRAFT Formulation and Analysis of Linear Programs
DRAFT Formulation and Analysis of Linear Programs Benjamin Van Roy and Kahn Mason c Benjamin Van Roy and Kahn Mason September 26, 2005 1 2 Contents 1 Introduction 7 1.1 Linear Algebra..........................
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More informationENM 202 OPERATIONS RESEARCH (I) OR (I) 2 LECTURE NOTES. Solution Cases:
ENM 202 OPERATIONS RESEARCH (I) OR (I) 2 LECTURE NOTES Solution Cases: 1. Unique Optimal Solution Case 2. Alternative Optimal Solution Case 3. Infeasible Solution Case 4. Unbounded Solution Case 5. Degenerate
More informationIntroduction to Operations Research
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 2 First Group of Students) Students with first letter of surnames A H Due: February 21, 2013 Problem Set Rules: 1. Each student
More informationMAT 111 Final Exam Fall 2013 Name: If solving graphically, sketch a graph and label the solution.
MAT 111 Final Exam Fall 2013 Name: Show all work on test to receive credit. Draw a box around your answer. If solving algebraically, show all steps. If solving graphically, sketch a graph and label the
More informationChapter 4 The Simplex Algorithm Part I
Chapter 4 The Simplex Algorithm Part I Based on Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Lewis Ntaimo 1 Modeling
More informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
More informationThe Simplex Algorithm
The Simplex Algorithm How to Convert an LP to Standard Form Before the simplex algorithm can be used to solve an LP, the LP must be converted into a problem where all the constraints are equations and
More informationIV. Violations of Linear Programming Assumptions
IV. Violations of Linear Programming Assumptions Some types of Mathematical Programming problems violate at least one condition of strict Linearity - Deterministic Nature - Additivity - Direct Proportionality
More informationMath 1101 Chapter 2 Review Solve the equation. 1) (y - 7) - (y + 2) = 4y A) B) D) C) ) 2 5 x x = 5
Math 1101 Chapter 2 Review Solve the equation. 1) (y - 7) - (y + 2) = 4y A) - 1 2 B) - 9 C) - 9 7 D) - 9 4 2) 2 x - 1 3 x = A) -10 B) 7 C) -7 D) 10 Find the zero of f(x). 3) f(x) = 6x + 12 A) -12 B) -2
More informationIntroduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role
Linear Programming RK Jana Lecture Outline Introduction to Linear Programming (LP) Historical Perspective Model Formulation Graphical Solution Method Simplex Method Introduction to LP Continued Today many
More informationIntroduction to Operations Research. Linear Programming
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationDistributed Real-Time Control Systems. Lecture Distributed Control Linear Programming
Distributed Real-Time Control Systems Lecture 13-14 Distributed Control Linear Programming 1 Linear Programs Optimize a linear function subject to a set of linear (affine) constraints. Many problems can
More informationMulticriteria Decision Making
Multicriteria Decision Making Goal Programming Multicriteria Decision Problems Goal Programming Goal Programming: Formulation and Graphical Solution 1 Goal Programming Goal programming may be used to solve
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 1 Second Group of Students (with first letter of surnames I Z) Problem Set Rules: Due: February 12, 2013 1. Each student should
More informationSample. Test Booklet. Subject: MA, Grade: HS PSSA 2013 Keystone Algebra 1. - signup at to remove - Student name:
Test Booklet Subject: MA, Grade: HS PSSA 2013 Keystone Algebra 1 Student name: Author: Pennsylvania District: Pennsylvania Released Tests Printed: Friday May 31, 2013 1 Which of the following inequalities
More informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
More informationOR: Exercices Linear Programming
OR: Exercices Linear Programming N. Brauner Université Grenoble Alpes Exercice 1 : Wine Production (G. Finke) An American distillery produces 3 kinds of genuine German wines: Heidelberg sweet, Heidelberg
More informationIntroduction to Systems of Equations
Systems of Equations 1 Introduction to Systems of Equations Remember, we are finding a point of intersection x 2y 5 2x y 4 1. A golfer scored only 4 s and 5 s in a round of 18 holes. His score was 80.
More informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
More informationBachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)
AOR-01 ASSIGNMENT BOOKLET Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.) It is compulsory to submit the assignment before filling in the exam form.
More informationOptimization. Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization. General form:
Optimization Broadly two types: Unconstrained and Constrained optimizations We deal with constrained optimization General form: Min or Max f(x) (1) Subject to g(x) ~ b (2) lo < x < up (3) Some important
More informationLinear Programming: Model Formulation and Graphical Solution
Linear Programming: Model Formulation and Graphical Solution 1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization Model Example
More informationALGEBRA UNIT 5 LINEAR SYSTEMS SOLVING SYSTEMS: GRAPHICALLY (Day 1)
ALGEBRA UNIT 5 LINEAR SYSTEMS SOLVING SYSTEMS: GRAPHICALLY (Day 1) System: Solution to Systems: Number Solutions Exactly one Infinite No solution Terminology Consistent and Consistent and Inconsistent
More informationIntroduction to Operations Research Answers to selected problems
Exercise session 1 Introduction to Operations Research Answers to selected problems 1. Decision variables: Prof. dr. E-H. Aghezzaf, assistant D. Verleye Department of Industrial Management (IR18) x 1 =
More informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
More informationLinear Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Linear Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Linear Programming 1 / 148
More informationLinear Programming. Dr. Xiaosong DING
Linear Programming Dr. Xiaosong DING Department of Management Science and Engineering International Business School Beijing Foreign Studies University Dr. DING (xiaosong.ding@hotmail.com) Linear Programming
More informationName Per. Keystone Exams Practice Test A.) $300,000 B.) $400,000 C.) $500,000 D.) $600,000
Name Per Basic Skills Keystone Exams Practice Test 1.) A theme park charges $52 for a day pass and $110 for a week pass. Last month, 4,432 day passes and 979 week passes were sold. Which of the following
More information6. 5x Division Property. CHAPTER 2 Linear Models, Equations, and Inequalities. Toolbox Exercises. 1. 3x = 6 Division Property
CHAPTER Linear Models, Equations, and Inequalities CHAPTER Linear Models, Equations, and Inequalities Toolbox Exercises. x = 6 Division Property x 6 = x =. x 7= Addition Property x 7= x 7+ 7= + 7 x = 8.
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationChapter 2. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-1
Linear Programming: Model Formulation and Graphical Solution Chapter 2 2-1 Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions of Linear Programming Models A Minimization
More informationNotes A E F. $11,960; $242,000 G. $14,337; $117,800 H % I. 12% K. a = 3, b = 2 or a = -3, b = -2
1.01 A. 1 15 5 3 7 5 + 15 B. 3 3 7 + 6 150 C. D. 9 0 16 49 E. 15 05. F. $11,960; $4,000 G. $14,337; $117,800 H. 3.856% I. 1% J. 10 7 log 14. 1 9 or e ln 7 14. 1 9 7 or 9 14.1 K. a = 3, b = or a = -3, b
More informationDEPARTMENT OF MATHEMATICS
This is for your practice. DEPARTMENT OF MATHEMATICS Ma162 Samples from old Final Exams 1. Fred Foy has $100, 000 to invest in stocks, bonds and a money market account. The stocks have an expected return
More informationMATH 2070 Mixed Practice KEY Sections (25) 900(.95 )
1. The demand for board games can be modeled by D( p ) = 9(.9) p thousand games where p is the price in dollars per game. Find the consumers surplus when the market price for the board game is $. per game.
More informationSpring 2018 IE 102. Operations Research and Mathematical Programming Part 2
Spring 2018 IE 102 Operations Research and Mathematical Programming Part 2 Graphical Solution of 2-variable LP Problems Consider an example max x 1 + 3 x 2 s.t. x 1 + x 2 6 (1) - x 1 + 2x 2 8 (2) x 1,
More informationMath Applications 544
Math Applications The applications that follow are like the ones you will encounter in many workplaces. Use the mathematics you have learned in this chapter to solve the problems. Wherever possible, use
More information7.1 Solving Systems of Equations
Date: Precalculus Notes: Unit 7 Systems of Equations and Matrices 7.1 Solving Systems of Equations Syllabus Objectives: 8.1 The student will solve a given system of equations or system of inequalities.
More information(MATH 1203, 1204, 1204R)
College Algebra (MATH 1203, 1204, 1204R) Departmental Review Problems For all questions that ask for an approximate answer, round to two decimal places (unless otherwise specified). The most closely related
More informationConcept and Definition. Characteristics of OR (Features) Phases of OR
Concept and Definition Operations research signifies research on operations. It is the organized application of modern science, mathematics and computer techniques to complex military, government, business
More informationAM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1
AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1 Prof. Yiling Chen Fall 2018 Here are some practice questions to help to prepare for the midterm. The midterm will
More informationName: Class: Date: ID: A
Name: Class: Date: 8th Grade Advanced Topic III, Linear Equations and Systems of Linear Equations, MA.8.A.1.1, MA.8.1.1.2, MA.8.A.1.3, *MA.8.A.1.4, MA.8.A.1.5, MA.8.A.1.6 Multiple Choice Identify the choice
More informationIE 400 Principles of Engineering Management. Graphical Solution of 2-variable LP Problems
IE 400 Principles of Engineering Management Graphical Solution of 2-variable LP Problems Graphical Solution of 2-variable LP Problems Ex 1.a) max x 1 + 3 x 2 s.t. x 1 + x 2 6 - x 1 + 2x 2 8 x 1, x 2 0,
More informationCSC Design and Analysis of Algorithms. LP Shader Electronics Example
CSC 80- Design and Analysis of Algorithms Lecture (LP) LP Shader Electronics Example The Shader Electronics Company produces two products:.eclipse, a portable touchscreen digital player; it takes hours
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More informationExam. Name. Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function.
Exam Name Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function. 1) z = 12x - 22y y (0, 6) (1.2, 5) Solve the 3) The Acme Class Ring Company
More informationPREPARED BY: INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 PREPARED BY: A. SOMAIAH, ASST. PROFESSOR T. VANAJA, ASST. PROFESSOR DEPT. OF MECHANICAL ENGINEERING 1 Syllabus UNIT-I Development
More information