Please choose correct answers and explain them 1.Human intelligence is not neede
ID: 461214 • Letter: P
Question
Please choose correct answers and explain them
1.Human intelligence is not needed in which one of the following steps of solving optimization problems?
A. writing the problem formulation in words
B. writing the algebraic formulation of the problem
C. developing a spreadsheet model
D. solving the problem
E. interpreting the results
2. Sausage and Cheese Ltd. prepares three gift packages containing sausages and cheeses. The “Tasters,” “Succulent,” and “Gourmet” gift packages contain 3 sausages and 6 cheeses, 5 sausages and 4 cheeses, and 6 sausages and 5 cheeses, respectively. There are 2500 sausages and 3000 cheeses available for packing, and demand is unlimited. Profits are $2.50, $3.50, and $4.00 for the “Tasters,” “Succulent,” and “Gourmet” gift packages, respectively. The goal is to maximize profits. Let T, S, and G represent the number of gift packages produced of type “Tasters,” “Succulent,” and “Gourmet,” respectively. What is the objective function for this linear program?
A. Max (3T + 5S + 6G)
B. Max (2.5T + 3.5S + 4G)
C. Min (T + S + G)
D. Min (10(T + S + G))
E. Max (6T + 4S + 5G)
3. Suppose that a firm makes gears (G) and axles (A). Each gear requires 15 minutes of labor and each axle requires 30 minutes of labor. One thousand hours of labor are available. How should the labor constraint(s) be written?
A. G + A 1000
B. 0.25G + 0.5A 1000
C. G 15 and A 30
D. 0.25G + 0.5A 1000
E. 15G + 30A 1000
4. In a linear programming optimization problem, the solutions that are located at the corners of the feasible region are called the
A. Decision Variables
B. Constraints
C. Objective Functions
D. Extreme Points
Explanation / Answer
1. D.
Human intelligence is not needed in solving the problem. Once the spreadsheet model is developed, the solving algorithm can do the same with the variables entered. All the other steps outlined need human intelligence.
2. B
Given the Profitability of each of the 3 sausages,
Total Profitability = 2.5T + 3.5 S + 4G
The goal is to maximize profit.
Thus, the objective function is Max (2.5T + 3.5S + 4G)
3. B
Each gear takes 0.25 hours and each axle takes 0.5 hours. The total number of hours has to be less than or equal to 1000. If G is the number of Gears and A, the number of axles, then
0.25G + 0.5A <= 1000
4. D
The solutions located at the corners of feasible region are also known as Extreme points.