1 Non-negativity constraints
a. restrict the decision variables to zero
b. restrict the decision variables to positive values
c. do not restrict the sign of the decision variable
d. restrict the decision variables to negative values
e. both A and B
2 The production manager for Beer Etc. produces two kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. He can get, at most, 4800 oz. of malt per week and 3200 oz. of wheat per week. 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. What is the optimal weekly profit?
a. $1000
b. $900
c. $800
d. $700
e. $600
3 Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). each 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 $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and and for each medium shelf is $150. Which of the following is a feasible purchase combination?
a. 100 big shelves and 100 medium shelves
b. 150 big shelves and 0 medium shelves
c. 0 big shelves and 200 medium shelves
d. 0 big shelves and 0 medium shelves
4 He owner of Chips Etc. produces two kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the three ingredients used to produce these chips available for his next production run: 4,800 ounces of salt, 9,600 ounces of flour, and 2,000 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. What is the constraint for salt?
a. 2L + 1V ? 800
b. 2L + 3V ? 4800
c. 6L + 8V ? 4800
d. 1L + 2V ? 4800
e. 3L + 2V ? 4800
5 A systematic approach to model formulation is to first
a. determine the right hand side of each constraint
b. define decision variables
c. develop each constraint
d. construct the objective function
e. all of the above
6 If a maximization linear programming problem consists of all less than or equal to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programing optimal solution values of the decision variables will ____________result in a feasible solution to the integer linear programing problem.
a. sometimes
b. never
c. always