MGSC 395 EXAM 2 SUPPLEMENT D QUESTIONS WITH
VERIFIED ANSWERS
Graphical analysis of a linear programming model can accommodate how many
decision variables, as a practical consideration - Answers - two
a feasible region - Answers - is an area bounded by the collective constraints and
represents all permissible combinations of the decision variable
the linear programming solution procedure in computer codes is some form of the
________, which is an iterative algebraic procedure for solving linear programming
problems - Answers - simplex method
all the following statements about the simplex method are true EXCEPT - Answers - all
corner points are evaluated and the decision maker chooses the best one
the choices that the decision maker can control in the model are called - Answers -
decision variables
As a consistency check, make sure that the same ________ (is/are) being used on both
sides of each constraint - Answers - unit of measure
the following define the corner points of a feasible region with decision variables labeled
as X (horizontal axis) and Y (vertical axis):
[x,y]: 0,0 ; 0,15 ; 25,0
which of the listed of constraints is included within the feasible region? - Answers - 3X +
5Y < or = 75
the goal of an objective function is often expressed as - Answers - minimizing Z or
maximizing Z
if a decision variable has no impact on the objective function, then - Answers - its
objective function coefficient is 0
formulating a linear programming model to represent a unique problem requires a three-
step sequence. Which of the following is NOT one of the three steps - Answers -
determining the product's unit of measure
which of the following statements is NOT true regarding linear programming (LP) -
Answers - the feasible region will always have at least one point
VERIFIED ANSWERS
Graphical analysis of a linear programming model can accommodate how many
decision variables, as a practical consideration - Answers - two
a feasible region - Answers - is an area bounded by the collective constraints and
represents all permissible combinations of the decision variable
the linear programming solution procedure in computer codes is some form of the
________, which is an iterative algebraic procedure for solving linear programming
problems - Answers - simplex method
all the following statements about the simplex method are true EXCEPT - Answers - all
corner points are evaluated and the decision maker chooses the best one
the choices that the decision maker can control in the model are called - Answers -
decision variables
As a consistency check, make sure that the same ________ (is/are) being used on both
sides of each constraint - Answers - unit of measure
the following define the corner points of a feasible region with decision variables labeled
as X (horizontal axis) and Y (vertical axis):
[x,y]: 0,0 ; 0,15 ; 25,0
which of the listed of constraints is included within the feasible region? - Answers - 3X +
5Y < or = 75
the goal of an objective function is often expressed as - Answers - minimizing Z or
maximizing Z
if a decision variable has no impact on the objective function, then - Answers - its
objective function coefficient is 0
formulating a linear programming model to represent a unique problem requires a three-
step sequence. Which of the following is NOT one of the three steps - Answers -
determining the product's unit of measure
which of the following statements is NOT true regarding linear programming (LP) -
Answers - the feasible region will always have at least one point
