Provide answers to the questions only. No explanation is needed.

1. Which resource management application involves determining the optimal pricing structure for the entire organization?

a. None of the others

b. Manpower scheduling

c. Yield Management

d. Investment portfolio design

2. Which one of the following special LP conditions does NOT require model reformulation to obtain a solution?

a. Infeasible

b. Proportional

c. Multiple optimal

d. Unbounded

3. What is the effect on the critical project time if the time for a non-critical task is decreased by one time unit?

a. No impact

b. Normal impact

c. Unknown impact

d. Large impact

4. Which model is most closely associated with predictive analytics?

a. NPV

b. Regression

c. Decision trees

d. Payoff tables

5. What is the value for Yr in the regression model: Yr = 20 - 4*X, when X = 3?

a. 0

b. 20

c. 3

d. 8

6. Why are beta regression coefficients useful?

a. Improve accuracy

b. Maximize residuals

c. Minimize co-linearity

d. Directly compare the impact of predictor variables

7. Which one is the primary reason for using simulation modeling?

a. Develops optimal solutions

b. Lack realism

c. Limited to linear relationships

d. Conduct analysis without disrupting the actual business system

8. Which one of the following sets of multiple time estimates is an example of a constant task time?

a. 5,6,10

b. 2,4,6

c. 3,3,3

d. 4,10,12

9. What method is most commonly used for generating a straight line through a set of points on a scatterplot?

a. Most squares

b. Normal squares

c. Average squares

d. Least squares

10. Which one is best for fixing an infeasible LP solution?

a. Collecting more data

b. Removing one or more constraints

c. Adding more constraints

d. Adding more variables

11. Which one of the following is a basic linear programming assumption?

a. Integer solutions

b. Only equality constraints

c. Deterministic coefficients

d. Non-linear relationships

12. Which one best describes a feasible solution to an LP problem?

a. Need not satisfy all of the constraints

b. Must satisfy all of the constraints simultaneously

c. Must optimize the value of the objective function

d. Must be on the boundary