Page 1 of 64
Business Analytics 2 Professor Winkofsky Final
Exam
Download now
Johns Hopkins University
School of Nursing
HIGH YIELDS QUESTIONS
NEWEST MODEL 2026 EXAM LATEST
VERSION SOLVED QUESTIONS &
ANSWERS VERIFIED 100 %
Exam
, Page 2 of 64
Business Analytics 2 Professor Winkofsky Final Exam
The term _____ refers to the expression that defines the quantity to be
maximized or minimized in a linear programming model.
a) objective function
b) problem formulation
c) decision variable
d) association rule
a) objective function
Constraints are _____.
a) quantities to be minimized in a linear programming model
b) restrictions that limit the settings of the decision variables c) input variables
that can be controlled during optimization
d) quantities to be maximized in a linear programming model
b) restrictions that limit the settings of the decision variables
_____, or modeling, is the process of translating a verbal statement of a
problem into a mathematical statement.
A) Problem formulation
B) Data preparation
C) Data structuring
D) Problem-solving approach
A) Problem formulation
A mathematical function in which each variable appears in a separate term and
is raised to the first power is known as a _____.
a) nonlinear function
, Page 3 of 64
b) what-if function
c) power function
d) linear function
d) linear function
A(n) _____ solution satisfies all the constraint expressions simultaneously.
a) infeasible
b) feasible
c) extreme
d) objective
b) feasible
The points where constraints intersect on the boundary of the feasible region
are termed as the _____.
a) objective function contour
b) feasible edges
c) extreme points
d) feasible points
c) extreme points
A _____ refers to a constraint that can be expressed as an equality at the
optimal solution
a) binding constraint
b) first class constraint
c) nonnegativity constraint
d) slack variable
a) binding constraint
The _____ value for each less-than-or-equal-to constraint indicates the
difference between the left-hand and right-hand values for a constraint.
a) slack
b) unbounded
c) surplus
d) objective function coefficient
, Page 4 of 64
a) slack
The slack value for binding constraints is _____.
a) always a positive integer
b) equal to the sum of the optimal points in the solution
c) a negative integer
d) zero
d) zero
Use the applet "Feasible Region" to answer the following questions.
(a)
Which constraint results in a least upper bound for the optimal number of
Deluxe Bags?
A) Inspection & Packaging
B) Cutting & Dyeing
C) Sewing
D) Finishing
(b)
Which constraint results in a least upper bound for the optimal number of
Standard Bags?
A) Inspection & Packaging
B) Cutting & Dyeing
C) Sewing
D) Finishing
(c)
Which constraint could be removed without affecting the feasible solution
region?
A) Inspection & Packaging
B) Cutting & Dyeing
C) Sewing
D) Finishing
(a)
Inspection & Packaging
(b)
Business Analytics 2 Professor Winkofsky Final
Exam
Download now
Johns Hopkins University
School of Nursing
HIGH YIELDS QUESTIONS
NEWEST MODEL 2026 EXAM LATEST
VERSION SOLVED QUESTIONS &
ANSWERS VERIFIED 100 %
Exam
, Page 2 of 64
Business Analytics 2 Professor Winkofsky Final Exam
The term _____ refers to the expression that defines the quantity to be
maximized or minimized in a linear programming model.
a) objective function
b) problem formulation
c) decision variable
d) association rule
a) objective function
Constraints are _____.
a) quantities to be minimized in a linear programming model
b) restrictions that limit the settings of the decision variables c) input variables
that can be controlled during optimization
d) quantities to be maximized in a linear programming model
b) restrictions that limit the settings of the decision variables
_____, or modeling, is the process of translating a verbal statement of a
problem into a mathematical statement.
A) Problem formulation
B) Data preparation
C) Data structuring
D) Problem-solving approach
A) Problem formulation
A mathematical function in which each variable appears in a separate term and
is raised to the first power is known as a _____.
a) nonlinear function
, Page 3 of 64
b) what-if function
c) power function
d) linear function
d) linear function
A(n) _____ solution satisfies all the constraint expressions simultaneously.
a) infeasible
b) feasible
c) extreme
d) objective
b) feasible
The points where constraints intersect on the boundary of the feasible region
are termed as the _____.
a) objective function contour
b) feasible edges
c) extreme points
d) feasible points
c) extreme points
A _____ refers to a constraint that can be expressed as an equality at the
optimal solution
a) binding constraint
b) first class constraint
c) nonnegativity constraint
d) slack variable
a) binding constraint
The _____ value for each less-than-or-equal-to constraint indicates the
difference between the left-hand and right-hand values for a constraint.
a) slack
b) unbounded
c) surplus
d) objective function coefficient
, Page 4 of 64
a) slack
The slack value for binding constraints is _____.
a) always a positive integer
b) equal to the sum of the optimal points in the solution
c) a negative integer
d) zero
d) zero
Use the applet "Feasible Region" to answer the following questions.
(a)
Which constraint results in a least upper bound for the optimal number of
Deluxe Bags?
A) Inspection & Packaging
B) Cutting & Dyeing
C) Sewing
D) Finishing
(b)
Which constraint results in a least upper bound for the optimal number of
Standard Bags?
A) Inspection & Packaging
B) Cutting & Dyeing
C) Sewing
D) Finishing
(c)
Which constraint could be removed without affecting the feasible solution
region?
A) Inspection & Packaging
B) Cutting & Dyeing
C) Sewing
D) Finishing
(a)
Inspection & Packaging
(b)
