QUANTITATIVE ANALYSIS FOR
MANAGEMENT – 100 PRACTICE QUESTIONS
& ANSWERS
(Correct answers marked with ✔️✔️)
1–20: Linear Programming (LP)
1. What is the main objective of linear programming?
A. To create random models
B. To optimize a limited resource
C. To forecast trends
D. To simulate a market
Answer: B
2. Which is not an assumption of LP models?
A. Divisibility
B. Certainty
C. Additivity
D. Randomness
Answer: D
3. The feasible region in LP represents:
A. All possible solutions
B. Only infeasible solutions
C. Decision variables
D. Optimization function
Answer: A
4. In LP, binding constraints are:
A. Constraints not affecting the solution
B. Constraints that hold with equality at optimality
C. Extra constraints
,D. Slack variables
Answer: B
5. Slack variables measure:
A. Excess resource
B. Unused resource
C. Cost
D. Profit
Answer: B
6. If objective function lines are parallel to a boundary of the feasible region, the solution is:
A. Unique
B. Infeasible
C. Multiple optimal solutions
D. Unbounded
Answer: C
7. Iso-profit lines in LP are used to:
A. Identify the optimal corner point
B. Change the constraints
C. Add randomness
D. Remove infeasibility
Answer: A
8. A negative value for a slack variable indicates:
A. Feasibility
B. Violation of the constraint
C. Optimality
D. Redundancy
Answer: B
9. An unbounded LP solution occurs when:
A. No feasible region exists
B. Objective can increase indefinitely
C. Constraints intersect
D. Slack is zero
Answer: B
10. Sensitivity analysis determines:
A. Variable ranges without changing solution
,B. Mean and median
C. Random behavior
D. Profit only
Answer: A
11. A redundant constraint:
A. Cannot be removed
B. Does not affect the optimal solution
C. Always binds
D. Causes infeasibility
Answer: B
12. In LP, decision variables represent:
A. Objectives
B. Choices to be determined
C. Slack
D. Constraints only
Answer: B
13. Standard form LP uses:
A. Inequalities only
B. Equalities only
C. Mixed constraints
D. None
Answer: B
14. Graphical LP can solve how many variables?
A. One
B. Two
C. Three
D. Unlimited
Answer: B
15. The objective function coefficient range tells us:
A. Feasible region
B. Stability of the optimal solution
C. Profit only
D. Constraints
Answer: B
, 16. Corner-point method checks:
A. All interior points
B. Only extreme points
C. Only slack
D. Random points
Answer: B
17. A binding resource means:
A. No unused amount
B. Extra units remain
C. No effect on solution
D. Violates constraints
Answer: A
18. The shadow price indicates:
A. Cost of labor
B. Change in objective per unit resource added
C. Value of slack
D. Profit margin
Answer: B
19. If shadow price = 0:
A. Resource is binding
B. Resource has no value to objective
C. Resource is scarce
D. Objective changes
Answer: B
20. Degeneracy in LP means:
A. No solution
B. Optimal solution with zero-valued basic variable
C. Overuse
D. Randomness
Answer: B
21–40: Transportation & Assignment Models
21. Transportation models seek to:
A. Maximize advertising
MANAGEMENT – 100 PRACTICE QUESTIONS
& ANSWERS
(Correct answers marked with ✔️✔️)
1–20: Linear Programming (LP)
1. What is the main objective of linear programming?
A. To create random models
B. To optimize a limited resource
C. To forecast trends
D. To simulate a market
Answer: B
2. Which is not an assumption of LP models?
A. Divisibility
B. Certainty
C. Additivity
D. Randomness
Answer: D
3. The feasible region in LP represents:
A. All possible solutions
B. Only infeasible solutions
C. Decision variables
D. Optimization function
Answer: A
4. In LP, binding constraints are:
A. Constraints not affecting the solution
B. Constraints that hold with equality at optimality
C. Extra constraints
,D. Slack variables
Answer: B
5. Slack variables measure:
A. Excess resource
B. Unused resource
C. Cost
D. Profit
Answer: B
6. If objective function lines are parallel to a boundary of the feasible region, the solution is:
A. Unique
B. Infeasible
C. Multiple optimal solutions
D. Unbounded
Answer: C
7. Iso-profit lines in LP are used to:
A. Identify the optimal corner point
B. Change the constraints
C. Add randomness
D. Remove infeasibility
Answer: A
8. A negative value for a slack variable indicates:
A. Feasibility
B. Violation of the constraint
C. Optimality
D. Redundancy
Answer: B
9. An unbounded LP solution occurs when:
A. No feasible region exists
B. Objective can increase indefinitely
C. Constraints intersect
D. Slack is zero
Answer: B
10. Sensitivity analysis determines:
A. Variable ranges without changing solution
,B. Mean and median
C. Random behavior
D. Profit only
Answer: A
11. A redundant constraint:
A. Cannot be removed
B. Does not affect the optimal solution
C. Always binds
D. Causes infeasibility
Answer: B
12. In LP, decision variables represent:
A. Objectives
B. Choices to be determined
C. Slack
D. Constraints only
Answer: B
13. Standard form LP uses:
A. Inequalities only
B. Equalities only
C. Mixed constraints
D. None
Answer: B
14. Graphical LP can solve how many variables?
A. One
B. Two
C. Three
D. Unlimited
Answer: B
15. The objective function coefficient range tells us:
A. Feasible region
B. Stability of the optimal solution
C. Profit only
D. Constraints
Answer: B
, 16. Corner-point method checks:
A. All interior points
B. Only extreme points
C. Only slack
D. Random points
Answer: B
17. A binding resource means:
A. No unused amount
B. Extra units remain
C. No effect on solution
D. Violates constraints
Answer: A
18. The shadow price indicates:
A. Cost of labor
B. Change in objective per unit resource added
C. Value of slack
D. Profit margin
Answer: B
19. If shadow price = 0:
A. Resource is binding
B. Resource has no value to objective
C. Resource is scarce
D. Objective changes
Answer: B
20. Degeneracy in LP means:
A. No solution
B. Optimal solution with zero-valued basic variable
C. Overuse
D. Randomness
Answer: B
21–40: Transportation & Assignment Models
21. Transportation models seek to:
A. Maximize advertising
