MAT 540 Week 11 FINAL EXAM
1. Which of the following could be a linear programming objective function?
2. Which of the following could not be a linear programming problem constraint?
3. Types of integer programming models are _____________
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
5. The reduced cost (shadow price) for a positive decision variable is 0
6. Decision variables
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
8. Decision models are mathematical symbols representing levels of activity.
9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.
10. In a transportation problem, items are allocated from sources to destinations
11. In a media selection problem, the estimated number of customers reached by a given media would generally be specified in the _________________. Even if these media exposure estimates are correct, using media exposure as a surrogate does not lead to maximization of ___.
12. ____________ solutions are ones that satisfy all the constraints simultaneously.
13. In a linear programming problem, a valid objective function can be represented as
14. The standard form for the computer solution of a linear programming problem requires all variables to the right and all numerical values to the left of the inequality or equality sign
15. Constraints representing fractional relationships such as the production quantity of product 1 must be at least twice as much as the production quantity of products 2, 3 and 4 combined cannot be input into computer software packages because the left side of the inequality does not consist of consists of pure numbers.
16. In a balanced transportation model where supply equals demand
17. The objective function is a linear relationship reflecting the objective of an operation.
18. The owner of Chips etc. produces 2 kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the 3 ingredients used to produce these chips available for his next production run: 4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of Lime chips requires 2 ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produce; while a bag of Vinegar chips requires 3 ounces of salt, 8 ounces of flour, and 2 ounces of herbs. Profits for a bag of Lime chips are $0.40, and for a bag of Vinegar chips $0.50. Which of the following is not a feasible production combination?
19. The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.
20. For a maximization problem, assume that a constraint is binding. If the original amount of a resource is 4 lbs., and the range of feasibility (sensitivity range) for this constraint is from
3 lbs. to 6 lbs., increasing the amount of this resource by 1 lb. will result in the
21. In a total integer model, all decision variables have integer solution values.
23. Linear programming is a model consisting of linear relationships representing a firm’s decisions given an objective and resource constraints.
24. When using linear programming model to solve the “diet” problem, the objective is generally to maximize profit.
25. In a balanced transportation model where supply equals demand, all constraints are equalities.
26. In a transportation problem, items are allocated from sources to destinations at a minimum cost.
27. Mallory Furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Which of the following is not a feasible purchase combination?
28. In a mixed integer model, some solution values for decision variables are integer and others can be non-integer.
29. In a 0 – 1 integer model, the solution values of the decision variables are 0 or 1.
30. Determining the production quantities of different products manufactured by a company based on resource constraints is a product mix linear programming problem.
31. When the right-hand sides of 2 constraints are both increased by 1 unit, the value of the objective function will be adjusted by the sum of the constraints’ prices.
32. The transportation method assumes that
33. A constraint is a linear relationship representing a restriction on decision making.
34. When formulating a linear programming model on a spreadsheet, the measure of performance is located in the target cell.
35. The linear programming model for a transportation problem has constraints for supply at each ________ and _________ at each destination.
36. The 3 types of integer programming models are total, 0 – 1, and mixed.
37. In using rounding of a linear programming model to obtain an integer solution, the solution is
38. If we use Excel to solve a linear programming problem instead of QM for Windows,
then the data input requirements are likely to be much less tedious and time consuming.
39. In a _______ integer model, some solution values for decision variables are integer and others can be non-integer.
40. Which of the following is not an integer linear programming problem?