Mod B And Ch 4 Solutions 1 
3101 MSOM
3rd in-class Group Assignment (Mod B and Ch 4)
Q1) 39) A linear programming problem that aims to minimize cost, has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100. Which of the following statements about its feasible region is true? (2-points)
A) There are four corner points including (50, 0) and (0, 12.5).
B) The two corner points are (0, 0) and (50, 12.5).
C) The feasible region is triangular in shape, bounded by (50, 0), (33-1/3, 8-1/3), and (100, 0).
D) The graphical origin (0, 0) is in the feasible region.
Answer: C
Q2) A manager must decide on the mix of products to produce for the coming week. Product A requires three minutes per unit for molding, two minutes per unit for painting, and one minute for packing. Product B requires two minutes per unit for molding, four minutes for painting, and three minutes per unit for packing. There will be 600 minutes available for molding, 600 minutes for painting, and 420 minutes for packing. Both products have contributions of $1.50 per unit. Formulate the problem, solve and determine what combination of A and B will maximize contribution, and what is the maximum possible contribution? (3-points)
Answer:
A = 150 units, B = 75 units will yield a maximum profit of $337.5
Q3) If cars sell for $500 profit and trucks sell for $300 profit which of the following represents the objective function? (2-points)
A) Maximize = 500C+300T
B) Minimize = 500C + 300T
C) Maximize = 500C — 300T
D) Minimize = 300T- 500C
Answer: ___A___
Q4) A linear programming problem has three constraints: 2X + 10Y ≤ 100 4X + 6Y ≤ 120 6X + 3Y ≤ 90
What is the largest quantity of X that can be made without violating any of these constraints? (2-points)
Answer: ____15__
Q5) A gold processor has two sources of gold ore, source A and source B. In order to keep his plant running, at least three tons of ore must be processed each day. Ore from source A costs $20 per ton to process, and ore from source B costs $10 per ton to process. Costs
3rd in-class Group Assignment (Mod B and Ch 4)
Q1) 39) A linear programming problem that aims to minimize cost, has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100. Which of the following statements about its feasible region is true? (2-points)
A) There are four corner points including (50, 0) and (0, 12.5).
B) The two corner points are (0, 0) and (50, 12.5).
C) The feasible region is triangular in shape, bounded by (50, 0), (33-1/3, 8-1/3), and (100, 0).
D) The graphical origin (0, 0) is in the feasible region.
Answer: C
Q2) A manager must decide on the mix of products to produce for the coming week. Product A requires three minutes per unit for molding, two minutes per unit for painting, and one minute for packing. Product B requires two minutes per unit for molding, four minutes for painting, and three minutes per unit for packing. There will be 600 minutes available for molding, 600 minutes for painting, and 420 minutes for packing. Both products have contributions of $1.50 per unit. Formulate the problem, solve and determine what combination of A and B will maximize contribution, and what is the maximum possible contribution? (3-points)
Answer:
A = 150 units, B = 75 units will yield a maximum profit of $337.5
Q3) If cars sell for $500 profit and trucks sell for $300 profit which of the following represents the objective function? (2-points)
A) Maximize = 500C+300T
B) Minimize = 500C + 300T
C) Maximize = 500C — 300T
D) Minimize = 300T- 500C
Answer: ___A___
Q4) A linear programming problem has three constraints: 2X + 10Y ≤ 100 4X + 6Y ≤ 120 6X + 3Y ≤ 90
What is the largest quantity of X that can be made without violating any of these constraints? (2-points)
Answer: ____15__
Q5) A gold processor has two sources of gold ore, source A and source B. In order to keep his plant running, at least three tons of ore must be processed each day. Ore from source A costs $20 per ton to process, and ore from source B costs $10 per ton to process. Costs