Question 8
1. Consider the following linear programming problem:

This is a special case of a linear programming problem in which
there is no feasible solution.
there is a redundant constraint.
there are multiple optimal solutions.
this cannot be solved graphically.
None of these

Question 9
1. Typical resources of an organization include ______.
machinery usage
labor volume
warehouse space utilization
raw material usage
All of these

Question 10
1. Infeasibility in a linear programming problem occurs when
there is an infinite solution.
a constraint is redundant.
more than one solution is optimal.
the feasible region is unbounded.
there is no solution that satisfies all the constraints given.

Question 11
1. Managers use the network analysis of PERT and CPM to help them
derive flexibility by identifying noncritical activities.
replan, reschedule, and reallocate resources such as manpower and finances.
plan, schedule, monitor, and control large and complex projects.
All of these
None of these

Question 12
1. Andre Candess manages an office supply store. One product in the store is computer paper. Andre knows that 10,000 boxes will be sold this year at a constant rate throughout the year. There are 250 working days per year and the lead-time is 3 days. The cost of placing an order is $30, while the holding cost is $15 per box per year. How many units should Andre order each time?
200
400
500
100
None of these

Question 13
1. The mathematical theory behind linear programming states that an optimal solution to any problem will lie at a(n) ______of the feasible region.
interior point or center
maximum point or minimum point
corner point or extreme point
interior point or extreme point
None of these

Question 14
1. When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and
finding the profit at every corner point of the feasible region to see which one gives the highest value.
moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered.
locating the point that is highest on the graph.
None of these
All of these

Question 15
1. In a PERT network, the earliest (activity) start time is the
earliest time that an activity can be finished without delaying the entire project.
latest time that an activity can be started without delaying the entire project.
earliest time that an activity can start without violation of precedence requirements.
latest time that an activity can be finished without delaying the entire project.
None of these

Question 16
1. A feasible solution to a linear programming problem
must be a corner point of the feasible region.
must satisfy all of the problem's constraints simultaneously.
need not satisfy all of the constraints, only the non-negativity constraints.
must give the maximum possible profit.
must give the minimum possible cost.

Question 17
1. The first step in planning and scheduling a project is to develop the ______.
employee scheduling plan
PERT/CPM network diagram
critical path
work breakdown structure
variance calculations for each activity

Question 21
1. PERT stands for ______.
probabilistic evaluation and review technique
program evaluation and review technique
probability of expected run times
program of expected run times
project evaluation and review technique

Question 23
1. With ______, inventory arrives just before it is needed.
VMI
ABC
ERP
JIT
JBT

Question 24
1. Inventory
is any stored resource used to satisfy current or future need.
includes raw materials, work-in-process, and finished goods.
levels for finished goods are a direct function of demand.
needs from raw materials through finished goods can be reasonably determined, once finished goods demand is determined.
All of these

Question 25
1. Daily demand for newspapers for the last 10 days has been as follows: 12, 13, 16, 15, 12, 18, 14, 12, 13, 15 (listed from oldest to most recent). Forecast sales for the next day using a three-day weighted moving average where the weights are 3, 1, and 1 (the highest weight is for the most recent number).
12.8
13.0
70.0
14.0
None of these