MODULE B: LINEAR PROGRAMMING
TRUE/FALSE
1
.
Linear programming helps operations managers make decisions necessary to make effective use of
resources such as machinery, labor, money, time, and raw materials.
True (Introduction, easy)
2
.
One requirement of a linear programming problem is that the objective function must be expressed
as a linear equation.
True (Introduction, easy)
3
.
A common form of the product-mix linear programming seeks to find that combination of products
and the quantity of each that maximizes profit in the presence of limited resources.
True
(Formulating linear programming problems, moderate)
4
.
Linear programming is an appropriate problem-solving technique for decisions that have no
alternative courses of action.
False (Requirements of a linear programming problem, easy)
5
.
In linear programming, a statement such as "maximize contribution" becomes an objective function
when the problem is formulated.
True (Formulating linear programming problems, moderate)
6.
Constraints are needed to solve linear programming problems by hand, but not by computer.
False (Graphical solution to a linear programming problem, easy) {AACSB: Use of IT}
7
.
In terms of linear programming, the fact that the solution is infeasible implies that the "profit" can
increase without limit.
False (Graphical solution to a linear programming problem, moderate)
8
.
The region that satisfies all of the constraints in graphical linear programming is called the region
of optimality.
False (Graphical solution to a linear programming problem, moderate)
9
.
Solving a linear programming problem with the iso-profit line solution method requires that we
move the iso-profit line to each corner of the feasible region until the optimum is identified.
False (Graphical solution to a linear programming problem, moderate)
10.
The optimal solution to a linear programming problem is within the feasible region.
True (Graphical solution to a linear programming problem, moderate)
11
.
For a linear programming problem with the constraints 2X + 4Y
≤
100 and 1X + 8Y ≤ 100, two of
its corner points are (0, 0) and (0, 25).
False (Graphical solution to a linear programming
problem, moderate) {AACSB: Analytic Skills}
12.
In linear programming, if there are three constraints, each representing a resource that can be used
up, the optimal solution must use up all of each of the three resources.
False (Graphical solution to a linear programming problem, moderate)
13.
The region that satisfies the constraint 4X + 15Z ≥ 1000 includes the origin of the graph.
False (Graphical solution to a linear programming problem, easy) {AACSB: Analytic Skills}
14.
The optimal solution of a linear programming problem that consists of two variables and six
constraints will probably not satisfy all six constraints precisely.