2026/2027 THE
ELITE TEST BANK:
QUANTITATIVE
APPROACHES TO
DECISION
MAKING
PART 0: THE NAVIGATOR
● PART I: THE PRIMER
○ Welcome to the Big Leagues
○ The "Critical Action" Cheat Sheet
● PART II: THE ELITE TEST BANK
○ Questions 1–28: Foundational Syntax & Application (LP, Sensitivity, Networks,
DEA, Game Theory)
○ Questions 29–58: Professional Simulation (PERT/CPM, Inventory, Queuing,
Decision Analysis, AHP, Forecasting, Markov)
○ Questions 59–88: Grandmaster Synthesis (Agentic AI, Quantum Optimization,
Systemic Integration, 2026/2027 Standards)
PART I: THE PRIMER
Welcome to the big leagues. This document is designed to intercept high-stakes quantitative
errors before they execute in the real world. You are here to build professional intuition—the
ability to look at a matrix, an algorithm, or an AI-augmented supply chain and instantly identify
the optimal path and the hidden catastrophic risk.
,The "Critical Action" Cheat Sheet:
● The 100% Rule (Sensitivity Analysis): Simultaneous changes to objective function
coefficients or right-hand sides will not change the optimal basis if the sum of the
percentage changes (relative to their allowable increases/decreases) is \le 100\%.
● AHP Consistency Ratio (CR): CR must be \le 0.10. If CR > 0.10, the decision-maker's
pairwise comparisons are logically fractured and must be re-evaluated.
● Little's Law: L = \lambda W. The long-term average number of customers in a stable
system (L) equals the long-term average effective arrival rate (\lambda) multiplied by the
average time a customer spends in the system (W).
● Agentic AI Governance (2026/2027 Standard): Agentic systems must operate under
bounded autonomy. Without a structured ontological truth model (objects, relationships,
strict escalation rules), AI execution becomes brittle and unsafe at scale.
PART II: THE ELITE TEST BANK
Q1: A firm aims to maximize profit Z = 40x_1 + 50x_2. During the formulation of this Linear
Programming (LP) model, the analyst realizes that the availability of raw materials fluctuates
randomly each week. Which LP assumption is DIRECTLY violated by this reality? A)
Proportionality B) Additivity C) Divisibility D) Certainty
● The Answer: D (Certainty)
● Distractor Analysis:
○ A is incorrect: Proportionality dictates that the contribution of each variable is strictly
proportional to its value, unaffected by randomness.
○ B is incorrect: Additivity ensures total usage equals the sum of individual usages.
○ C is incorrect: Divisibility assumes variables can take fractional values.
The Mentor's Analysis: Deterministic models require hard data. The moment a parameter
becomes a probability distribution rather than a fixed scalar, you have exited classical LP and
entered the domain of stochastic programming or simulation. Professional Intuition: Never
force stochastic reality into a deterministic LP model without explicitly acknowledging the
certainty assumption constraint.
Q2: When utilizing the graphical solution procedure for a minimization LP problem, the optimal
solution is ALWAYS found where? A) At the intersection of the objective function and the
highest feasible isocost line. B) At an extreme point of the feasible region. C) At the origin,
provided all constraints are non-negativity constraints. D) At the centroid of the feasible region
to minimize variance.
● The Answer: B (At an extreme point of the feasible region.)
● Distractor Analysis:
○ A is incorrect: Minimization seeks the lowest feasible isocost line, not the highest.
○ C is incorrect: The origin is often infeasible in minimization problems due to
"greater-than-or-equal-to" constraints.
○ D is incorrect: The centroid is irrelevant in linear optimization; optimality resides on
the boundary.
The Mentor's Analysis: The fundamental theorem of linear programming states that if an
optimal solution exists, it must exist at a vertex (extreme point). Professional Intuition: You do
not need to search the entire feasible space; you only need to evaluate the intersections of your
constraints.
Q3: An optimal LP solution yields a shadow price (dual value) of $0 for a specific machine-hour
,constraint. What is the MOST APPROPRIATE conclusion regarding this machine? A) Procuring
an additional hour of machine time will increase the objective function by exactly $1. B) The
constraint is currently binding. C) There is non-zero slack associated with this machine's
capacity. D) The machine should be sold immediately as it provides no value.
● The Answer: C (There is non-zero slack associated with this machine's capacity.)
● Distractor Analysis:
○ A is incorrect: A shadow price of $0 means an additional hour adds $0.
○ B is incorrect: Binding constraints have zero slack and typically non-zero shadow
prices.
○ D is incorrect: Zero marginal value for additional capacity does not mean the
existing baseline capacity is worthless.
The Mentor's Analysis: A shadow price of zero indicates an abundant resource. You already
have more than you need for the current optimal mix. Professional Intuition: Never spend
capital to expand a bottleneck that isn't actually a bottleneck.
Q4: A production manager notes that the objective function coefficient for Product A increases
by 40% of its allowable increase, and Product B decreases by 50% of its allowable decrease.
According to the 100% Rule, what is the IMMEDIATE consequence? A) The shadow prices will
change, but the optimal mix remains identical. B) The optimal product mix (basis) will absolutely
remain unchanged. C) The optimal product mix will definitely change. D) The problem becomes
unbounded.
● The Answer: B (The optimal product mix (basis) will absolutely remain unchanged.)
● Distractor Analysis:
○ A is incorrect: Changes to objective function coefficients do not change shadow
prices.
○ C is incorrect: Because 40\% + 50\% = 90\%, which is \le 100\%, the basis is
guaranteed to remain optimal.
○ D is incorrect: Coefficient changes do not cause unboundedness.
The Mentor's Analysis: The 100% Rule is a quick diagnostic tool for simultaneous changes. If
the sum of the ratio of changes is under 1, the optimal geometry holds. Professional Intuition:
Use this rule to confidently approve minor pricing or cost fluctuations without having to rerun the
entire simplex algorithm.
Q5: In Data Envelopment Analysis (DEA), the objective function for evaluating a specific
Decision Making Unit (DMU) is typically set up to: A) Minimize the total inputs across all DMUs.
B) Maximize the efficiency score of the target DMU, capped at 1.0. C) Maximize the sum of
outputs for all competing DMUs. D) Minimize the shadow prices of the composite DMU.
● The Answer: B (Maximize the efficiency score of the target DMU, capped at 1.0.)
● Distractor Analysis:
○ A & C are incorrect: DEA evaluates one specific DMU at a time against a composite
benchmark. * D is incorrect: DEA minimizes inputs or maximizes outputs for the
target DMU, not shadow prices.
The Mentor's Analysis: DEA is a relative performance metric. It gives the target
branch/hospital/unit the "benefit of the doubt" by choosing weights that make it look as efficient
as mathematically possible, capped at 100%. Professional Intuition: If a DMU scores below
1.0 even when the math is rigged in its favor, its operational inefficiency is undeniable.
Q6: You are formulating a transportation problem. The total capacity of all supply nodes equals
50,000 units, but the total demand of all destination nodes equals 60,000 units. What is the
FIRST required step to solve this using standard network simplex methods? A) Introduce a
dummy supply node with a capacity of 10,000 units and zero transportation costs. B) Introduce
, a dummy destination node with a demand of 10,000 units and zero transportation costs. C)
Multiply all supply capacities by a factor of 1.2 to balance the network. D) Proceed normally;
modern solvers do not require balanced networks.
● The Answer: A (Introduce a dummy supply node with a capacity of 10,000 units and zero
transportation costs.)
● Distractor Analysis:
○ B is incorrect: A dummy destination is used when Supply > Demand. Here, Demand
> Supply.
○ C is incorrect: Falsifying actual supply capabilities leads to physically impossible
production schedules.
○ D is incorrect: Classical transportation algorithms require balancing via dummies.
The Mentor's Analysis: Unbalanced networks represent reality; balancing them is a
mathematical necessity. The dummy supply represents the unmet demand (shortage).
Professional Intuition: The flow assigned to the dummy node tells you exactly which
customers will be shorted and by how much.
Q7: In an assignment problem where 4 workers are to be assigned to 4 tasks, how many
variables will be in the linear programming formulation, and what type of variables must they
be? A) 8 variables; continuous B) 16 variables; strictly binary (0 or 1) C) 4 variables; integer D)
16 variables; continuous
● The Answer: B (16 variables; strictly binary (0 or 1))
● Distractor Analysis:
○ A is incorrect: 4 \times 4 = 16 distinct assignment possibilities.
○ C is incorrect: You need a matrix of i \times j variables.
○ D is incorrect: The variables must conceptually be binary (assigned or not
assigned).
The Mentor's Analysis: The assignment problem is a special case of the transportation
problem where supply and demand equal 1. Every intersection of Worker i and Task j requires a
binary variable. Professional Intuition: Recognize special structures. You can solve this with
LP, but the Hungarian Method is computationally vastly superior.
Q8: A portfolio manager is using the Markowitz portfolio model. The objective function is
formulated to minimize the portfolio variance. What serves as the primary constraint in this
specific nonlinear optimization model? A) The expected return of the portfolio must meet or
exceed a specified minimum target. B) The sum of the asset weights must equal exactly 0. C)
The covariance between all assets must be explicitly minimized. D) The maximum investment in
any single asset cannot exceed 10%.
● The Answer: A (The expected return of the portfolio must meet or exceed a specified
minimum target.)
● Distractor Analysis:
○ B is incorrect: The sum of weights must equal 1 (100%).
○ C is incorrect: Covariance is a parameter inside the objective function's variance
calculation, not a constraint.
○ D is incorrect: The fundamental mathematical constraint that drives the efficient
frontier is the minimum acceptable return.
The Mentor's Analysis: Markowitz balances fear (variance) and greed (expected return). By
minimizing variance subject to a floor on returns, you map the efficient frontier. Professional
Intuition: Risk cannot be minimized in a vacuum; it must always be anchored against the
required yield.
Q9: In a PERT/CPM network, Activity F has an Earliest Start Time (ES) of 12, an Earliest Finish
ELITE TEST BANK:
QUANTITATIVE
APPROACHES TO
DECISION
MAKING
PART 0: THE NAVIGATOR
● PART I: THE PRIMER
○ Welcome to the Big Leagues
○ The "Critical Action" Cheat Sheet
● PART II: THE ELITE TEST BANK
○ Questions 1–28: Foundational Syntax & Application (LP, Sensitivity, Networks,
DEA, Game Theory)
○ Questions 29–58: Professional Simulation (PERT/CPM, Inventory, Queuing,
Decision Analysis, AHP, Forecasting, Markov)
○ Questions 59–88: Grandmaster Synthesis (Agentic AI, Quantum Optimization,
Systemic Integration, 2026/2027 Standards)
PART I: THE PRIMER
Welcome to the big leagues. This document is designed to intercept high-stakes quantitative
errors before they execute in the real world. You are here to build professional intuition—the
ability to look at a matrix, an algorithm, or an AI-augmented supply chain and instantly identify
the optimal path and the hidden catastrophic risk.
,The "Critical Action" Cheat Sheet:
● The 100% Rule (Sensitivity Analysis): Simultaneous changes to objective function
coefficients or right-hand sides will not change the optimal basis if the sum of the
percentage changes (relative to their allowable increases/decreases) is \le 100\%.
● AHP Consistency Ratio (CR): CR must be \le 0.10. If CR > 0.10, the decision-maker's
pairwise comparisons are logically fractured and must be re-evaluated.
● Little's Law: L = \lambda W. The long-term average number of customers in a stable
system (L) equals the long-term average effective arrival rate (\lambda) multiplied by the
average time a customer spends in the system (W).
● Agentic AI Governance (2026/2027 Standard): Agentic systems must operate under
bounded autonomy. Without a structured ontological truth model (objects, relationships,
strict escalation rules), AI execution becomes brittle and unsafe at scale.
PART II: THE ELITE TEST BANK
Q1: A firm aims to maximize profit Z = 40x_1 + 50x_2. During the formulation of this Linear
Programming (LP) model, the analyst realizes that the availability of raw materials fluctuates
randomly each week. Which LP assumption is DIRECTLY violated by this reality? A)
Proportionality B) Additivity C) Divisibility D) Certainty
● The Answer: D (Certainty)
● Distractor Analysis:
○ A is incorrect: Proportionality dictates that the contribution of each variable is strictly
proportional to its value, unaffected by randomness.
○ B is incorrect: Additivity ensures total usage equals the sum of individual usages.
○ C is incorrect: Divisibility assumes variables can take fractional values.
The Mentor's Analysis: Deterministic models require hard data. The moment a parameter
becomes a probability distribution rather than a fixed scalar, you have exited classical LP and
entered the domain of stochastic programming or simulation. Professional Intuition: Never
force stochastic reality into a deterministic LP model without explicitly acknowledging the
certainty assumption constraint.
Q2: When utilizing the graphical solution procedure for a minimization LP problem, the optimal
solution is ALWAYS found where? A) At the intersection of the objective function and the
highest feasible isocost line. B) At an extreme point of the feasible region. C) At the origin,
provided all constraints are non-negativity constraints. D) At the centroid of the feasible region
to minimize variance.
● The Answer: B (At an extreme point of the feasible region.)
● Distractor Analysis:
○ A is incorrect: Minimization seeks the lowest feasible isocost line, not the highest.
○ C is incorrect: The origin is often infeasible in minimization problems due to
"greater-than-or-equal-to" constraints.
○ D is incorrect: The centroid is irrelevant in linear optimization; optimality resides on
the boundary.
The Mentor's Analysis: The fundamental theorem of linear programming states that if an
optimal solution exists, it must exist at a vertex (extreme point). Professional Intuition: You do
not need to search the entire feasible space; you only need to evaluate the intersections of your
constraints.
Q3: An optimal LP solution yields a shadow price (dual value) of $0 for a specific machine-hour
,constraint. What is the MOST APPROPRIATE conclusion regarding this machine? A) Procuring
an additional hour of machine time will increase the objective function by exactly $1. B) The
constraint is currently binding. C) There is non-zero slack associated with this machine's
capacity. D) The machine should be sold immediately as it provides no value.
● The Answer: C (There is non-zero slack associated with this machine's capacity.)
● Distractor Analysis:
○ A is incorrect: A shadow price of $0 means an additional hour adds $0.
○ B is incorrect: Binding constraints have zero slack and typically non-zero shadow
prices.
○ D is incorrect: Zero marginal value for additional capacity does not mean the
existing baseline capacity is worthless.
The Mentor's Analysis: A shadow price of zero indicates an abundant resource. You already
have more than you need for the current optimal mix. Professional Intuition: Never spend
capital to expand a bottleneck that isn't actually a bottleneck.
Q4: A production manager notes that the objective function coefficient for Product A increases
by 40% of its allowable increase, and Product B decreases by 50% of its allowable decrease.
According to the 100% Rule, what is the IMMEDIATE consequence? A) The shadow prices will
change, but the optimal mix remains identical. B) The optimal product mix (basis) will absolutely
remain unchanged. C) The optimal product mix will definitely change. D) The problem becomes
unbounded.
● The Answer: B (The optimal product mix (basis) will absolutely remain unchanged.)
● Distractor Analysis:
○ A is incorrect: Changes to objective function coefficients do not change shadow
prices.
○ C is incorrect: Because 40\% + 50\% = 90\%, which is \le 100\%, the basis is
guaranteed to remain optimal.
○ D is incorrect: Coefficient changes do not cause unboundedness.
The Mentor's Analysis: The 100% Rule is a quick diagnostic tool for simultaneous changes. If
the sum of the ratio of changes is under 1, the optimal geometry holds. Professional Intuition:
Use this rule to confidently approve minor pricing or cost fluctuations without having to rerun the
entire simplex algorithm.
Q5: In Data Envelopment Analysis (DEA), the objective function for evaluating a specific
Decision Making Unit (DMU) is typically set up to: A) Minimize the total inputs across all DMUs.
B) Maximize the efficiency score of the target DMU, capped at 1.0. C) Maximize the sum of
outputs for all competing DMUs. D) Minimize the shadow prices of the composite DMU.
● The Answer: B (Maximize the efficiency score of the target DMU, capped at 1.0.)
● Distractor Analysis:
○ A & C are incorrect: DEA evaluates one specific DMU at a time against a composite
benchmark. * D is incorrect: DEA minimizes inputs or maximizes outputs for the
target DMU, not shadow prices.
The Mentor's Analysis: DEA is a relative performance metric. It gives the target
branch/hospital/unit the "benefit of the doubt" by choosing weights that make it look as efficient
as mathematically possible, capped at 100%. Professional Intuition: If a DMU scores below
1.0 even when the math is rigged in its favor, its operational inefficiency is undeniable.
Q6: You are formulating a transportation problem. The total capacity of all supply nodes equals
50,000 units, but the total demand of all destination nodes equals 60,000 units. What is the
FIRST required step to solve this using standard network simplex methods? A) Introduce a
dummy supply node with a capacity of 10,000 units and zero transportation costs. B) Introduce
, a dummy destination node with a demand of 10,000 units and zero transportation costs. C)
Multiply all supply capacities by a factor of 1.2 to balance the network. D) Proceed normally;
modern solvers do not require balanced networks.
● The Answer: A (Introduce a dummy supply node with a capacity of 10,000 units and zero
transportation costs.)
● Distractor Analysis:
○ B is incorrect: A dummy destination is used when Supply > Demand. Here, Demand
> Supply.
○ C is incorrect: Falsifying actual supply capabilities leads to physically impossible
production schedules.
○ D is incorrect: Classical transportation algorithms require balancing via dummies.
The Mentor's Analysis: Unbalanced networks represent reality; balancing them is a
mathematical necessity. The dummy supply represents the unmet demand (shortage).
Professional Intuition: The flow assigned to the dummy node tells you exactly which
customers will be shorted and by how much.
Q7: In an assignment problem where 4 workers are to be assigned to 4 tasks, how many
variables will be in the linear programming formulation, and what type of variables must they
be? A) 8 variables; continuous B) 16 variables; strictly binary (0 or 1) C) 4 variables; integer D)
16 variables; continuous
● The Answer: B (16 variables; strictly binary (0 or 1))
● Distractor Analysis:
○ A is incorrect: 4 \times 4 = 16 distinct assignment possibilities.
○ C is incorrect: You need a matrix of i \times j variables.
○ D is incorrect: The variables must conceptually be binary (assigned or not
assigned).
The Mentor's Analysis: The assignment problem is a special case of the transportation
problem where supply and demand equal 1. Every intersection of Worker i and Task j requires a
binary variable. Professional Intuition: Recognize special structures. You can solve this with
LP, but the Hungarian Method is computationally vastly superior.
Q8: A portfolio manager is using the Markowitz portfolio model. The objective function is
formulated to minimize the portfolio variance. What serves as the primary constraint in this
specific nonlinear optimization model? A) The expected return of the portfolio must meet or
exceed a specified minimum target. B) The sum of the asset weights must equal exactly 0. C)
The covariance between all assets must be explicitly minimized. D) The maximum investment in
any single asset cannot exceed 10%.
● The Answer: A (The expected return of the portfolio must meet or exceed a specified
minimum target.)
● Distractor Analysis:
○ B is incorrect: The sum of weights must equal 1 (100%).
○ C is incorrect: Covariance is a parameter inside the objective function's variance
calculation, not a constraint.
○ D is incorrect: The fundamental mathematical constraint that drives the efficient
frontier is the minimum acceptable return.
The Mentor's Analysis: Markowitz balances fear (variance) and greed (expected return). By
minimizing variance subject to a floor on returns, you map the efficient frontier. Professional
Intuition: Risk cannot be minimized in a vacuum; it must always be anchored against the
required yield.
Q9: In a PERT/CPM network, Activity F has an Earliest Start Time (ES) of 12, an Earliest Finish
