1) Little’s Flow Equations are applicable for single-channel systems only.
2) The correlation coefficient has values between 1 and +1.
3) A model is a representation of a situation.
4) A hospital ward with only 30 beds could be modeled using a finite population model.
5) The four basic assumptions of Markov analysis are:
1. There are a limited or finite number of possible states.
2. The probability of changing states remains the same over time.
3. A future state is predictable from previous state and transition matrix.
4. The size and makeup of the system are constant during analysis.
6) Often, a plot of the residuals will highlight any glaring violations of the assumptions.
7) When solving very large integer programming problems, we sometimes have to
settle for a “good,” not necessarily optimal, answer.
8) The following figure illustrates a utility curve for someone who is a risk seeker.
9) In regression, an independent variable is sometimes called a response variable.
10) Simulation that is used with queuing models are probabilistic and do not have
Poisson arrivals nor exponential service times.
11) Goal programming permits multiple objectives to be satisfied.
12) Assignable variations in a process are also called natural variations.
13) In a transportation problem, a dummy source is given a zero cost, while in an
assignment problem, a dummy source is given a very high cost.
14) One reason inventory is required is the uneven flow of resources through a
company.
15) A traveling salesperson might use the shortest route technique to minimize the
distance traveled to reach one of his/her customers.
16) ( Use all of the product B available.
Let X1 = number of Zigs, X2 = number of Zags.
d1
– = underachievement of Zig goal
d1
+ = overachievement of Zig goal
d2
– = underachievement of profit target
d2
+ = overachievement of profit target
d3
– = unused product B
d3
+ = additional amount of product B needed
In the goal programming problem described in Table 10-7, what is the objective
function?
A) Min: P1d1
– + P1d1
+ + P2d2
+ + P2d2
– + P3d3
– + P3d3
+
B) Min: P1d1
– + P1d1
+ + P2d2
+ + P3d3
+
C) Min: P1d1
– + P1d1
+ + P2d2
– + P3d3
–
D) Min: P1d1
– + P2d2
– + P3d3
–
E) Min: P1d1
+ + P2d2
+ + P3d3
+
17) Table M7-2
According to Table M7-2, which is a summarized solution output from simplex
analysis, the optimal solution to this problem is
A) X1 = 0, X2 = 16.667, S1 = 300, S2 = 0.
B) X1 = 0, X2 = 16.667, S1 = 0, S2 = 0.
C) X1 = 12, X2 = 30, S1 = 0, S2 = 0.625.
D) X1 = 12, X2 = 30, S1 = 0.625, S2 = 0.
E) None of the above
18) Using the simplex method, we know we have an optimal solution when
A) all slack variables have a zero value.
B) all basic variables are negative.
C) all the real variables have a nonzero value.
D) all the artificial variables have a positive value.
E) None of the above
19) Table M2-4
For the shortest route problem described in Table M2-4, what is the length of the
shortest route?
A) 205 miles
B) 94 miles
C) 241 miles
D) 108 miles
E) None of the above
20) Which of the following statements about the decomposition method is/are false?
A) The process of “deseasonalizing” involves multiplying by a seasonal index.
B) Dummy variables are used in a regression model as part of an additive approach to
seasonality.
C) Computing seasonal indices is the first step of the decomposition method.
D) Data is “deseasonalized” after the trend line is found.
E) Decomposition can involve additive or multiplicative methods with respect to
seasonality.
21) Shadow prices represent
A) the value of one additional unit of a basic variable.
B) the value of one less unit of a basic variable.
C) the value of one less unit of a specific resource.
D) the value of one additional unit of a specific resource.
E) None of the above
22) The price/unit minus the variable cost/unit is
A) loss/unit when sales are below the break-even point.
B) the break-even point.
C) the Z value.
D) EOL.
E) None of the above
23) Given a network with the following distances:
(a) Determine which nodes should be connected to get the minimum distance from
Nodes 1 through 6.
(b) Determine the minimum distance.
24) Which Excel feature allows the user to specify a target or goal and the variable that
is desired to change in order to achieve that goal?
A) Solver
B) Goal Search
C) Target Search
D) Goal Seek
E) Target Seek
25) Enrollment in a particular class for the last four semesters has been 122, 128, 100,
and 155 (listed from oldest to most recent). The best forecast of enrollment next
semester, based on a three-semester moving average, would be
A) 116.7.
B) 126.3.
C) 168.3.
D) 135.0.
E) 127.7.
26) If variable cost/unit falls, the fixed cost rises, and the selling price/unit remains
constant, the break-even point
A) stays the same.
B) decreases.
C) increases.
D) None of the above
E) Unable to say without more information
27) Two models of a product Regular (X) and Deluxe (Y) are produced by a company.
A linear programming model is used to determine the production schedule. The
formulation is as follows:
The optimal solution is X = 100, Y = 0.
Which of these constraints is redundant?
A) the first constraint
B) the second constraint
C) the third constraint
D) All of the above
E) None of the above
28) Which of the following is not true for discrete random variables?
A) The expected value is the weighted average of the values.
B) They can assume only a countable number of values.
C) The probability of each value of the random variable must be 0.
D) The probability values always sum up to 1.
E) A binomial random variable is considered discrete.
29) For df1 = 4 and df2 = 5, what is the probability that F is greater than 4.5?
30) Data Equipment Inc. produces two models of a retail price scanner, a sophisticated
model that can be networked to a central processing unit and a stand-alone model for
small retailers. The major limitations of the manufacturing of these two products are
labor and material capacities. The following table summarizes the usages and capacities
associated with each product.
The typical LP formulation for this problem is:
31) List the 7 properties of linear programs
32) Given the following dual linear program, write the primal program.
33) Find the shortest route from Node 1 to each of the other nodes in the transportation
network represented below.
