OPERATIONS RESEARCH EXAMINATION QUESTIONS AND CORRECT ANSWER WITH EXPLANATION GRADED A+ STUDY GUIDE

OPERATIONS RESEARCH EXAMINATION QUESTIONS AND
CORRECT ANSWER WITH EXPLANATION GRADED A+
STUDY GUIDE SOUTHERN NEW HAMPSHIRE UNIVERSITY
1. Operations Research is mainly concerned with:
A. Optimal decision making
B. Story writing
C. Biology experiments
D. Painting
Answer: A
Rationale: It focuses on optimization and decisions.

2. The main goal of Operations Research is to:
A. Optimize resources
B. Increase confusion
C. Avoid calculations
D. Draw graphs only
Answer: A
Rationale: Efficient resource use.

3. Linear programming deals with:
A. Linear constraints and objective functions
B. Random equations
C. Biology systems
D. Chemistry reactions
Answer: A
Rationale: Mathematical optimization.

4. Objective function is:
A. Function to maximize or minimize
B. Random equation
C. Constraint only
D. Constant value
Answer: A
Rationale: Goal of optimization.

5. Constraints are:
A. Limitations on variables

, B. Final answers
C. Random numbers
D. Graphs
Answer: A
Rationale: Restrictions in model.

6. Feasible region is:
A. Set of all possible solutions
B. Only one solution
C. No solution set
D. Random points
Answer: A
Rationale: Valid solutions.

7. Optimal solution is:
A. Best possible solution
B. Any solution
C. Worst solution
D. Random guess
Answer: A
Rationale: Best objective value.

8. Graphical method is used for:
A. Two-variable linear programming
B. Infinite variables
C. Biology problems
D. Writing essays
Answer: A
Rationale: 2D visualization.

9. Slack variable represents:
A. Unused resources
B. Extra profit
C. Random value
D. Loss only
Answer: A
Rationale: Surplus capacity.

10. Surplus variable represents:
A. Excess over constraint

, B. Shortage
C. Random value
D. Objective value
Answer: A
Rationale: Above minimum requirement.

11. Simplex method is used for:
A. Solving linear programming problems
B. Sorting data
C. Drawing shapes
D. Random guessing
Answer: A
Rationale: Optimization algorithm.

12. A basic feasible solution:
A. Satisfies all constraints
B. Violates constraints
C. Random point
D. No solution
Answer: A
Rationale: Valid solution.

13. Artificial variables are used in:
A. Simplex method
B. Geometry
C. Chemistry
D. Statistics only
Answer: A
Rationale: Handling constraints.

14. Dual problem relates to:
A. Primal linear programming problem
B. Geometry only
C. Graph theory only
D. Probability only
Answer: A
Rationale: Paired optimization.

15. Shadow price is:
A. Value of resource constraint