DECISION ANALYSIS FINAL EXAM
QUESTIONS WITH CORRECT
SOLUTIONS||100% GUARANTEED
PASS||UPDATED 2026/2027
SYLLABUS||<<RECENT VERSION>>
Feasible Region Ch. 2 pg. 25 - ANSWER ✓ The constraints of an LP model define
the set of feasible solutions/region for the problem.
corner points (extreme points) Ch. 2 pg. 29 - ANSWER ✓ If an LP problem has
an optimal solution with a finite objective function value, this solution will always
occur at a point in the feasible region where two or more of the boundary lines of
the constraints intersect.
Alternate Optimal Solution Ch. 2 pg. 34 - ANSWER ✓ an additional optimal
solution for an LP model problem.
Redundant Constraint Ch. 2 pg. 34 - ANSWER ✓ a constraint that plays no role in
determining the feasible region of the problem.
Unbounded Solution Ch. 2 pg. 36 - ANSWER ✓
Infeasible Ch. 2 pg. 37 - ANSWER ✓ There is no way to simultaneously satisfy
all the constraints in the problem.
Loosening Ch. 2 pg. 38 - ANSWER ✓ (constraints) involves increasing the upper
limits (or reducing the lower limits) to expand the range of feasible solutions.
Solvers Ch. 3 pg. 46 - ANSWER ✓ all major spreadsheet packages come with
built-in spreadsheet optimization tools
, Steps in Implementing an LP Model in a Spreadsheet Ch. 3 pg. 47 - ANSWER ✓
(do not specifically need to be performed in this order)
1. Organize the data for the model on the spreadsheet.
2. Reserve separate cells in the spreadsheet to represent each decision variable in
the algebraic model.
3. Create a formula in a cell in the spreadsheet that corresponds to the objective
function in the algebraic model.
4. For each constraint, create a formula in a separate cell in the spreadsheet that
corresponds to the left-hand-side of the constraint.
Nonnegativity Conditions Ch. 3 pg. 52 - ANSWER ✓ Simple lower bounds like
Xsub1 >- 0 , indicate that the decision variables can assume only nonnegative
values.
How Solver Views the Model Ch. 3 pg. 52 - ANSWER ✓ we need to define 3
components of our spreadsheet model for Solver:
1. Objective cell:
the cell in the spreadsheet that represents the objective function in the model (and
whether its value should be maximized or minimized).
2. Variable cells:
The cells in the spreadsheet that represent the decision variables in the model (and
any upper and lower bounds that apply to these cells).
3. Constraint cells:
The cells in the spreadsheet that represent the LHS formulas of the constraints in
the model (and any upper and lower bounds that apply to these formulas).
Simplex Method Ch. 3 pg. 62 - ANSWER ✓ A special algorithm within Solver for
Excel. Provides an efficient way of solving LP problems, requires less solution
time. Allows for expanded sensitivity.
Goals and Guidelines for Spreadsheet Design Ch. 3 pg. 65 - ANSWER ✓ Goals: