THE PRODUCTION MANAGER FOR BEER ETC. PRODUCES 2 KINDS OF BEER: LIGHT (L) AND DARK (D). TWO RESOURCES USED TO PRODUCE BEER ARE MALT AND WHEAT.

THE PRODUCTION MANAGER FOR BEER ETC. PRODUCES 2 KINDS OF BEER: LIGHT (L) AND DARK (D). TWO RESOURCES USED TO PRODUCE BEER ARE MALT AND WHEAT. HE CAN OBTAIN AT MOST 4800 OZ OF MALT PER WEEK AND AT MOST 3200 OZ OF WHEAT PER WEEK RESPECTIVELY.
Final Draft of MAT 540 Final
1. Which of the following could be a linear programming objective function? (Points : 5)
Z = 1A + 2BC + 3D
Z = 1A + 2B + 3C + 4D
Z = 1A + 2B / C + 3D
Z = 1A + 2B2 + 3D
all of the above
2. Which of the following could not be a linear programming problem constraint? (Points : 5)
1A + 2B
1A + 2B = 3
1A + 2B LTOREQ 3
1A + 2B GTOREQ 3
3. Types of integer programming models are _____________. (Points : 5)
total
0 – 1
mixed
all of the above
4. The production manager for Beer etc. produces 2 kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. He can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle. If the production manager decides to produce of 0 bottles of light beer and 400 bottles of dark beer, it will result in slack of (Points : 5)
malt only
wheat only
both malt and wheat
neither malt nor wheat
5. The reduced cost (shadow price) for a positive decision variable is 0.
(Points : 5)
True
False
6. Decision variables (Points : 5)
measure the objective function
measure how much or how many items to produce, purchase, hire, etc.
always exist for each constraint
measure the values of each constrain
7. A plant manager is attempting to determine the production schedule of various products to maximize profit. Assume that a machine hour constraint is binding. If the original amount of machine hours available is 200 minutes., and the range of feasibility is from 130 minutes to 340 minutes, providing two additional machine hours will result in the: (Points : 5)
same product mix, different total profit
different product mix, same total profit as before
same product mix, same total profit
different product mix, different total profit
8. Decision models are mathematical symbols representing levels of activity.
(Points : 5)
True
False
9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.

Having Trouble Meeting Your Deadline?

Get your assignment on THE PRODUCTION MANAGER FOR BEER ETC. PRODUCES 2 KINDS OF BEER: LIGHT (L) AND DARK (D). TWO RESOURCES USED TO PRODUCE BEER ARE MALT AND WHEAT. completed on time. avoid delay and – ORDER NOW

Do My Paper

Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Order Now and we will direct you to our Order Page at Litessays. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.