Problem 1.
Max Z = 3x1 + 5x2
Subject to: 7x1 + 12x2 <= 136
3x1 + 5x2 <= 36
x1, x2 >= 0 and integer
Find the optimal solution.
Put your answer in the form of a solution for Z=
Problem 2. A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called:
A optimal
B. feasible
C. infeasible
D. semi-feasible
Problem 3. An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.
Problem 4. Sensitivity analysis information in computer output is based on the assumption of:
A. no coefficient change
B. one coefficient change
C. two coefficient change
D. all coefficients change
Problem 5. Let M be the number of units to make and B be the number of units to buy. If it costs $2 to make a unit and $3 to buy a unit and 4000 units are needed, the objective function is
A. Max 2M + 3B
B. Min 4000 (M + B)
C, Max 8000M + 12000B
D. Min 2M + 3B
Problem 6. A transportation problem with 3 sources and 4 destinations will have 7 terms in the objective function.
Problem 7. If a real-world problem is correctly formulated, it is not possible to have alternative optimal solutions.
Problem 8. The dual price for a constraint that compares funds used with funds available is .058. This means that:
A. the cost of additional funds is 5.8%
B. if more funds can be obtained at a rate of 5.5%, some should be
C. no more funds are needed
D. the objective was to minimize
Problem 9. The assignment problem can be considered to be a transportation problem, but the opposite is not true.
Problem 10. The main difference between Bayesian and Shafer-Dempster systems of probability is:
A. Shafer-Dempster is simply not accepted by the mathematical community.
B. Shafer-Dempster leaves room for future information to fill in present uncertainty.
C. Bayes has been discredited since it is so old.
D. Bayes uses past and prior probabilities for updates while Shafer-Dempster uses present and future probabilities.
F. None of the above are true