CHAPTER 7: LINEAR PROGRAMMING: GRAPICAL AND COMPUTER METHODS

1. When using a graphical solution procedure, the region bounded by the set of constraints
is called the:
a. Solution
b. Feasible region
c. Infeasible region
d. Maximum profit region
e. None of the above

2. In an LP problem, at least one corner point must be an optimal solution if an optimal

solution exists.
a. True
b. False

3. An LP problem has bounded feasible region. If this problem has an equality (=)
constraint, then
a. This must be a minimization problem
b. The feasible region must consist of a line segment
c. The feasible region must be degenerate
d. The problem must have more than one optimal solution

4. Which of the following would cause a change in the feasible region?

a. Increasing an objective function coefficient in a maximization problem
b. Adding a redundant constraint
c. Changing the right-hand side of nonredundant constraint
d. Increasing an objective function coefficient in a minimization problem

5. If a nonredundant constraint is removed from an LP problem, then

a. The feasible region will get larger
b. The feasible region will get smaller
c. The problem would become nonlinear
d. The problem would become infeasible

6. In the optimal solution to a linear program, there are 20 units of slack for a constraint.
From this we know that
a. The dual price for this constraint is 20
b. The dual price for this constraint is 0
c. This constraint must be redundant
d. The problem must be a maximization problem

7. A linear program has been solved and sensitivity analysis has been performed. The
ranges for the objective function coefficient have been found. For the profit on X1, the
upper bound is 80, the lower bound is 60, and the current value is 75. Which of the
 following must be true if the profit on this variable is lowered to 70 and the opti- mal
solution is found?

a. A new corner point will become optimal

b. The maximum possible total profit may increase
c. The values for all the decision variables will remain the same
d. All of the above are possible

8. A graphical method should only be used to solve an LP problem when

a. Thera are only two constraints
b. There are more than two constraints
c. There are only two variables
d. There are more than two variables

9. In LP, variables do not have to integer valued and may take on any fractional value. This
assumption is called:
a. Proportionality
b. Divisibility
c. Additivity
d. Certainty

10. In solving the linear program, no feasible solution exists. To resolve this problem we
might
a. Add another variable
b. Add another constraint
c. Remove or relax constraint
d. Try a different computer program

11. If the feasible region gets larger due to a change in one of the constraints, the optimal
value of the objective function
a. Must increase or remain the same for a maximization problem
b. Must decrease or remain the same for maximization problem
c. Must increase or remain the same for minimization problem
d. Cannot change

12. When alternate an optimal solution exist in an LP problem, then

a. The objective function will be parallel to one of the constraints
b. One of the constraints will be redundant
c. Two constraints will parallel
d. The problem will also unbounded

13. If a linear program is unbounded, the problem probably has not formulated correctly.
Which of the following would most likely cause this?
a. A constraint was inadvertently omitted
b. An unnecessary constraint was added to the problem
c. The objective function coefficients are too large
d. The objective function coefficients are too small

14. A feasible solution to an LP problem

a. Must satisfy all of the problem’s constraints simultaneously
b. Need not satisfy all of the constraint, only some of them
c. Must be a corner point of the feasible region
d. Must give the maximum possible profit

CHAPTER 8: LINEAR PROGRAMMING APPLICATIONS

15. Linear programming can be used to select effective media mixes, allocate fixed or limited
budgets across media, and maximize audience exposure
a. True
b. False

16. Using LP programming to maximize exposure in an advertising campaign is an example

of the type of LP application known as
a. Marketing research
b. Media selection
c. Portfolio assessment
d. Media budgeting
e. All of the above

17. Which of the following does not represent a factor manager might consider when
employing LP for production scheduling
a. Labor capacity
b. Space limitations
c. Product demand
d. Risk assessment
e. Inventory costs

18. A typical transportation problem has 4 sources and 3 destinations. How many decision
variables would there be in the linear program for this?
a. 3
b. 4
c. 7
d. 12

19. A typical transportation problem has 4 sources and 3 destinations. How many constraints
would there be in the linear program for this?
a. 3
b. 4
c. 7
d. 12

20. When applying LP to diet problems, the objective function is usually designed to
a. Maximize profits form blends of nutrients
b. Maximize ingredient blends
c. Minimize production losses
d. Maximize the number of products to be produced
e. Minimize the costs of nutrient blends
21. The diet problem is
a. Also called the feed mix problem in agriculture
b. A special case of the ingredient mix problem
c. A special case of the blending problem
d. All of the above

22. The selection of specific investment form among a wide variety of alternatives is the type
of LP problem known as
a. The product mix problem
b. The investment blanker
c. The portfolio selection problem
d. The Wall street problem
e. None of the above
23. The diet problem is: also called Pheonix problem in agriculture, a special case of the
ingredients mix problem, a special case of blending problem
24. Which of the following would have as one as the right-hand side value for each
constraint: assignment problem

CHAPTER 9: TRANSPORTATION AND ASSIGNMENT MODELS

25. If the total demand equals the total supply in a transportation problem, the problem is
a. Degenerate
b. Balanced
c. Unbalanced
d. Infeasible

26. If a transportation problem has 4 sources and 5 destinations, the linear program for this
will have
a. 4 variables and 5 constraints
b. 5 variables and 4 constraints
c. 9 variables and 20 constraints
d. 20 variables and 9 constraints

27. In s transportation problem, what indicates that the minimum cost solution has been
found?
a. All improvement indices are negative or zero
b. All improvement indices are positive or zero
c. All improvement indices are equal to zero
d. All cells in the dummy row are empty

28. An assignment problem may be viewed as a transportation problem with

a. A cost of $1 for all shipping routes
b. All supplies, demands equal to 1
c. Only demand constraints
d. Only supply constraints

29. If the number of filled cells in a transportation table does not equal the number of rows
plus the number of columns minus 1, then the problem is said to be
a. Unbalanced
b. Degenerate
c. Optimal
d. Maximization problem

30. If a solution transportation problem is degenerate, then

a. It will be impossible to evaluate all empty cells without removing the degeneracy
b. A dummy row or column must be added
c. Thera will be more than one optimal solution
d. The problem has no feasible solution

31. If the total demand is greater than the total capacity in a transportation problem, then
a. the optimal solution will be degenerate
b. a dummy source must be added
c. a dummy destination must be added
d. both a dummy source and a dummy destination must be added

32. In solving a facility location problem in which there are two possible locations being
considered, the transportation algorithm may be used. In doing this,
a. Two rows (sources) would be added to existing rows and enlarged problem would be
solved
b. Two separate transportation problems would be solved
c. Costs of zero would be used for each of the new facilities
d. The problem would be a transshipment problem

33. The Hungarian method is

a. A way to develop an initial solution to transportation problem
b. Used to solve assignment problem
c. Also called Vogel’s approximation method
d. Only used for problems in which the objective is to maximize profit

34. In an assignment problem, it may be necessary to add more than one row to table
a. True
b. False

35. When using the Hungarian method, an optimal assignment can always be made when
every row and every column has at least one zero
a. True
b. False
 36. An assignment problem can be viewed as a special type of transportation problem with
which of the following features?
a. The capacity for each source and the demand for each destination is equal to one
b. The number of rows is equal to the number of columns
c. The cost for each shipping route is equal to one
d. All of the above
CHAP 10: INTEGER PROGRAMMING
1. If all of the decision variables require integer solutions, the problem is
a. a pure integer programming type of problem.
b. a simplex method type of problem.
c. a mixed-integer programming type of problem.
d. a Gorsky type of problem.
2. In a mixed-integer programming problem
a. some integers must be even and others must be odd.
b. some decision variables must require integer results only and some variables
must allow for continuous results.
c. different objectives are mixed together even though they sometimes have relative
priorities established.
3. A model containing a linear objective function and linear constraints but requiring that one or
more of the decision variables take on an integer value in the final solution is called
a. an integer programming problem.
b. a goal programming problem.
c. a nonlinear programming problem.
d. a multiple objective LP problem.
4. An integer programming solution can never produce a greater profit than the LP solution to
the same problem.
a. True
b. False
5. In goal programming, if all the goals are achieved, the value of the objective function will
always be zero.
a. True
b. False
6. The objective in a goal programming problem with one priority level is to maximize the sum
of the deviational variables.
a. True
b. False
7. Nobel Laureate Herbert A. Simon of Carnegie-Mellon University says that modern managers
should always optimize, not satisfice.
a. True
b. False
8. The fixed charge problem is typically classified as
a. a goal programming problem.
b. a 0–1 integer problem.
c. a quadratic programming problem.
d. an assignment problem.
9. The 0–1 integer programming problem
a. requires the decision variables to have values between 0 and 1.
b. requires that the constraints all have coefficients between 0 and 1.
c. requires that the decision variables have coefficients between 0 and 1.
d. requires the decision variables to be equal to 0 or 1
10. Goal programming
a. requires only that you know whether the goal is direct profit maximization or cost
minimization.
b. allows you to have multiple goals.
c. is an algorithm with the goal of a quicker solution to the pure integer programming
problem.
d. is an algorithm with the goal of a quicker solution to the mixed-integer programming
problem.
11. Nonlinear programming includes problems
a. in which the objective function is linear but some constraints are not linear.
b. in which the constraints are linear but the objective function is not linear.
c. in which both the objective function and all of the constraints are not linear.
d. solvable by quadratic programming.
e. all of the above.

CHAPETR 11: NETWORK MODELS

37. Which technique is used to connect all points of a network together while minimizing the
distance between them?
a. Maximal flow
b. Minimal flow
c. Minimal-spanning tree
d. Shortest route
e. Longest span

38. The first step of minimal-spanning tree technique is to

a. Select the node with the highest distance between it and any other node
b. Select the node with the lowest distance between it and other nodes
c. Select the node that is closest to the origin
d. Select any arc that connects two nodes
e. Select any node

39. The first step to maximal-flow technique is to

a. Select any node
b. Pick any path from the start to the finish with some flow
c. Pick the path with the maximum flow
d. Pick the path with the minimum flow
e. Pick a path where the flow going into each node is greater than the flow coming out of
each node
40. In which technique do you connect the nearest node to the existing solution that is not
currently connected?
a. Maximal tree
b. Shortest route
c. Minimal-spanning tree
d. Maximal flow
e. Minimal flow

41. In the shortest-route technique, the objective is to determine the route form an origin to a
destination that passes through the fewest number of other nodes
a. True
b. False

42. Adjusting the flow capacity numbers on a path is an important step in which technique?
a. Maximal flow
b. Minimal flow
c. Maximal-spanning tree
d. Minimal-spanning tree
e. Shortest route

43. Which of the following may be considered a transshipment problem in which there is one
source with a supply of 1?
a. A maximal flow problem
b. A minimal-spanning tree problem
c. A minimal flow problem
d. A shortest-route problem

44. If the maximal flow problem is formulated as a linear program, the objective is to
a. Maximize the flow from the sink to the source
b. Minimize the total distance
c. Minimize the flow from the sink to the source
d. Find the shortest distance from the source to the sink

45. When the optimal solution has been reached with the maximal flow technique, every
node will be connected with at least one other node
a. True
b. False

46. A large city is planning for delays during rush hour when roads are closed for
maintenance. On a normal weekday, 160,000 vehicles travel on freeway from downtown
to a point 15 miles to the west. Which of the techniques discussed in this chapter would
help the city planner determine if alternate routes provide sufficient capacity for all the
traffic?
a. Maximal-spanning tree technique
b. Maximal-flow technique
c. Shortest route technique
47. The computing center at a major university is installing new fiber optic cables for a
campus wide computer network. Which of the techniques in this chapter could be used to
determine the least amount of cable needed to connect the 20 buildings on campus?
a. Minimal spanning tree
b. Maximal flow technique
c. Shortest route technique

48. In a minimal spanning tree problem, the optimal solution has been found when
a. The start node and the finish node are connected by a continuously path
b. The flow from the start node is equal to the flow into the finish node
c. All arcs have been selected to be a part of the tree
d. All nodes have been connected and are a part of the tree

49. ___shortest route__ is a technique that is used to find how a person or an item can travel
from one location to another wide minimizing the total distance traveled
50. The technique that allows us to determine the maximum amount of a material that can
flow through a network is called ___maximal flow___
51. The __minimal-spanning tree_______ technique can be used to connect all of the points
of a network together while minimizing the distance between them

CHPAETR 12: PROJECT MANAGEMENT

52. Network model such as PERT and CPM are used

a. To plan large and complex projects
b. To schedule large and complex projects
c. To monitor large and complex projects
d. To control large and complex projects
e. For all the above

53. The primary difference between PERT and CPM is that

a. PERT uses one time estimate
b. CPM has three times estimates
c. PERT has three times estimates
d. With CPM, it is assumed that all activities can be performed at the same time

54. The earliest start time for an activity is equal to

a. The largest EF of the immediate predecessors
b. The smallest EF of the immediate predecessors
c. The largest ES of the immediate predecessors
d. The smallest ES of the immediate predecessors

55. The latest finish time for an activity is found during the backward pass through the
network. The latest finish time equal to
a. The largest LF of the activities for which it is immediate predecessor
b. The smallest LF of the activities for which it is an immediate predecessor
c. The largest LS of the activities for which it is an immediate predecessor
d. The smallest LS of the activities for which it is an immediate predecessor

56. When PERT is used and probabilities are found, one of the assumptions that is made is
that
a. All activities are on the critical path
b. Activity times are independent
c. The project variance is equal to the sum of the variance of all activities in the project
d. All of the above

57. In PERT, the time estimate b represents

a. The most optimistic time
b. The most likely time
c. The most pessimistic time
d. The expected time
e. None of the above

58. In PERT, slack time equals

a. ES + t
b. LS – ES
c. 0
d. EF – ES

59. The standard deviation for the PERT project is approximately

a. The square root of the sum of the variances along the critical path
b. The sum of the critical path activity standard deviation
c. The square root of the sum of variances of the project activities
d. All of the above

60. The critical path is the

a. Shortest path in a network
b. Longest path in a network
c. Path with a largest variance
d. None of the above

61. If the project completion time is normally distributed and the due date for the project is
greater than expected completion time, then the probability that the project will be
finished be the due date is
a. Less than 0.50
b. Greater than 0.50
c. Equal to 0.50
d. Undeterminable without more information

62. If activity A is not one of critical path, the slack for A will equal
a. LF -EF
b. EF -ES
c. 0
d. all of the above
63. if a project is to be crashed at the minimum possible additional cost, then the first activity
to be crashed must be
a. on the critical path
b. the one with the shortest activity time
c. the one with the longest activity time
d. the one with the lowest cost
64. ___critical path___ activities are ones that will delay the entire project if they are late or
delayed
65. PERT stand for _program evaluation and review technique_____
66. Project crashing can be performed using a __linear programming model___
67. PERT can use three estimates for activity time. These are __optimistic___, __most
likely____, and ___pessimistic____
68. The latest start time minus the earliest start time called __slack____ time for any activity.
69. The percent of project completion, value of work completed, and actual activity costs are
used to _monitor and control___-projects.