Chapter 7 Linear Programming Models: Graphical and Computer Methods

1) Management resources that need control
include machinery usage, labor volume, money spent, time used, warehouse space
used, and material usage.

2) In the term linear programming, the
word programming comes from the phrase “computer programming.”

3) One of the assumptions of LP is
“simultaneity.”

4) Any linear programming problem can be
solved using the graphical solution procedure.

5) An LP formulation typically requires
finding the maximum value of an objective while simultaneously maximizing usage
of the resource constraints.

6) There are no limitations on the number
of constraints or variables that can be graphed to solve an LP problem.

7) Resource restrictions are called
constraints.

8) One of the assumptions of LP is
“proportionality.”

9) The set of solution points that
satisfies all of a linear programming problem’s constraints simultaneously is
defined as the feasible region in graphical linear programming.
10) An objective function is necessary in
a maximization problem but is not required in a minimization problem.
11) In some instances, an infeasible
solution may be the optimum found by the corner point method.

12) The rationality assumption implies
that solutions need not be in whole numbers (integers).

13) The solution to a linear programming
problem must always lie on a constraint.

14) In a linear program, the constraints
must be linear, but the objective function may be nonlinear.

15) Resource mix problems use LP to decide
how much of each product to make, given a series of resource restrictions.

16) The existence of non-negativity
constraints in a two-variable linear program implies that we are always working
in the northwest quadrant of a graph.

17) The shadow price is the same as the
dual price in maximization problems.

18) The term slack is associated with ?
constraints.
19) The term surplus is associated with ?
constraints.

20) Any time that we have an isoprofit
line that is parallel to a constraint, we have the possibility of multiple
solutions.
LP

21) If the isoprofit line is not parallel
to a constraint, then the solution must be unique.

22) When two or more constraints conflict
with one another, we have a condition called unboundedness.

23) The addition of a redundant constraint
lowers the isoprofit line.

24) Sensitivity analysis enables us to
look at the effects of changing the coefficients in the objective function, one
at a time.

25) A widely used mathematical programming
technique designed to help managers and decision making relative to resource
allocation is called
A) linear programming.
B) computer programming.
C) constraint programming.
D) goal programming.
E) None of the above

26) Typical resources of an organization
include
A) machinery usage.
B) labor volume.
C) warehouse space utilization.
D) raw material usage.
E) All of the above

27) Which of the following is not a
property of all linear programming problems?
A) the presence of restrictions
B) optimization of some objective
C) a computer program
D) alternate courses of action to choose
from
E) usage of only linear equations and
inequalities

28) A feasible solution to a linear
programming problem
A) must be a corner point of the feasible
region.
B) must satisfy all of the problem’s
constraints simultaneously.
C) need not satisfy all of the constraints,
only the non-negativity constraints.
D) must give the maximum possible profit.
E) must give the minimum possible cost.

29) Infeasibility in a linear programming
problem occurs when
A) there is an infinite solution.
B) a constraint is redundant.
C) more than one solution is optimal.
D) the feasible region is unbounded.
E) there is no solution that satisfies all
the constraints given.

30) In a maximization problem, when one or
more of the solution variables and the profit can be made infinitely large
without violating any constraints, the linear program has
A) an infeasible solution.
B) an unbounded solution.
C) a redundant constraint.
D) alternate optimal solutions.
E) None of the above