ULTIMATE MANAGEMENT SCIENCE
STUDY GUIDE SOLVED PRACTICE
QUESTIONS & RATIONALES
Master quantitative analysis and operations research with this
comprehensive, A+ graded test bank meticulously aligned with Bernard W.
Taylor's Introduction to Management Science. Every practice question
features clear multiple-choice options, italicized answers, and robust, bold-
italic rationales designed to clarify complex mathematical formulas and
optimization logic. This highly scannable, copy-and-paste ready study
guide is the ultimate resource for students seeking to ace exams and
master linear programming, project scheduling, inventory models, and
queuing theory.
Question 1
In a linear programming formulation, what term
describes the mathematical relationship that
represents a restriction on the availability of
resources?
A) Objective function
B) Constraint
C) Decision variable
D) Parameter
Rationale: Constraints mathematically define the
operational and resource limitations within an
optimization model, setting boundaries on the
feasible alternatives.
Question 2
,Why are non-negativity constraints (e.g., x₁, x₂ ≥ 0)
explicitly included in almost every standard linear
programming model?
A) To ensure that physical quantities produced or
allocated cannot be negative.
B) To make the objective function strictly linear.
C) To guarantee that a feasible region is always
bounded.
D) To simplify the simplex tableau initialization
process.
Rationale: In practical real-world operations,
negative production levels or negative asset
allocations do not make logical sense; these
constraints enforce physical reality.
Question 3
A company manufactures two products: Desks (x₁)
and Chairs (x₂). Each Desk requires 4 hours of
assembly, and each Chair requires 2 hours. Total
available assembly time per week is 100 hours. How
is this resource constraint correctly formulated?
A) 2x₁ + 4x₂ ≤ 100
B) 4x₁ + 2x₂ = 100
C) 4x₁ + 2x₂ ≤ 100
D) 4x₁ + 2x₂ ≥ 100
Rationale: The coefficients match the hourly
,requirements for each decision variable, and the
less-than-or-equal-to sign indicates that
resource utilization cannot exceed the maximum
capacity.
Question 4
Which assumption of linear programming states that
the contribution of any single variable to the
objective function or constraints is independent of
the values of other variables?
A) Proportionality
B) Divisibility
C) Additivity
D) Certainty
Rationale: Additivity implies that the total
objective or resource usage is the direct sum of
individual variable contributions, meaning there
are no cross-product or synergy effects.
Question 5
If a dietary requirement states that a patient must
consume at least 500 units of vitamin A daily from
food sources x₁ and x₂ (containing 20 and 50 units
per ounce respectively), what is the correct
constraint?
A) 20x₁ + 50x₂ ≤ 500
, B) 20x₁ + 50x₂ ≥ 500
C) 20x₁ + 50x₂ = 500
D) 500x₁ + 500x₂ ≥ 20 + 50
Rationale: The phrase "at least" translates
mathematically to a greater-than-or-equal-to
inequality, setting a minimum acceptable
threshold.
Question 6
What geometric shape characterizes the feasible
region of any two-variable linear programming
problem bound by linear constraints?
A) A circle
B) A parabola
C) A hyperbola
D) A convex polygon
Rationale: Because all constraints are linear
straight lines, their intersecting boundaries form
a convex polygon in two dimensions (or a
polyhedron in higher dimensions).
Question 7
According to the corner point property in linear
programming, where does an optimal solution
always lie?
A) At one or more of the extreme corner points of
STUDY GUIDE SOLVED PRACTICE
QUESTIONS & RATIONALES
Master quantitative analysis and operations research with this
comprehensive, A+ graded test bank meticulously aligned with Bernard W.
Taylor's Introduction to Management Science. Every practice question
features clear multiple-choice options, italicized answers, and robust, bold-
italic rationales designed to clarify complex mathematical formulas and
optimization logic. This highly scannable, copy-and-paste ready study
guide is the ultimate resource for students seeking to ace exams and
master linear programming, project scheduling, inventory models, and
queuing theory.
Question 1
In a linear programming formulation, what term
describes the mathematical relationship that
represents a restriction on the availability of
resources?
A) Objective function
B) Constraint
C) Decision variable
D) Parameter
Rationale: Constraints mathematically define the
operational and resource limitations within an
optimization model, setting boundaries on the
feasible alternatives.
Question 2
,Why are non-negativity constraints (e.g., x₁, x₂ ≥ 0)
explicitly included in almost every standard linear
programming model?
A) To ensure that physical quantities produced or
allocated cannot be negative.
B) To make the objective function strictly linear.
C) To guarantee that a feasible region is always
bounded.
D) To simplify the simplex tableau initialization
process.
Rationale: In practical real-world operations,
negative production levels or negative asset
allocations do not make logical sense; these
constraints enforce physical reality.
Question 3
A company manufactures two products: Desks (x₁)
and Chairs (x₂). Each Desk requires 4 hours of
assembly, and each Chair requires 2 hours. Total
available assembly time per week is 100 hours. How
is this resource constraint correctly formulated?
A) 2x₁ + 4x₂ ≤ 100
B) 4x₁ + 2x₂ = 100
C) 4x₁ + 2x₂ ≤ 100
D) 4x₁ + 2x₂ ≥ 100
Rationale: The coefficients match the hourly
,requirements for each decision variable, and the
less-than-or-equal-to sign indicates that
resource utilization cannot exceed the maximum
capacity.
Question 4
Which assumption of linear programming states that
the contribution of any single variable to the
objective function or constraints is independent of
the values of other variables?
A) Proportionality
B) Divisibility
C) Additivity
D) Certainty
Rationale: Additivity implies that the total
objective or resource usage is the direct sum of
individual variable contributions, meaning there
are no cross-product or synergy effects.
Question 5
If a dietary requirement states that a patient must
consume at least 500 units of vitamin A daily from
food sources x₁ and x₂ (containing 20 and 50 units
per ounce respectively), what is the correct
constraint?
A) 20x₁ + 50x₂ ≤ 500
, B) 20x₁ + 50x₂ ≥ 500
C) 20x₁ + 50x₂ = 500
D) 500x₁ + 500x₂ ≥ 20 + 50
Rationale: The phrase "at least" translates
mathematically to a greater-than-or-equal-to
inequality, setting a minimum acceptable
threshold.
Question 6
What geometric shape characterizes the feasible
region of any two-variable linear programming
problem bound by linear constraints?
A) A circle
B) A parabola
C) A hyperbola
D) A convex polygon
Rationale: Because all constraints are linear
straight lines, their intersecting boundaries form
a convex polygon in two dimensions (or a
polyhedron in higher dimensions).
Question 7
According to the corner point property in linear
programming, where does an optimal solution
always lie?
A) At one or more of the extreme corner points of
