In this network flow model, the flow of goods can occur both \"out\" of and \"in

Question

In this network flow model, the flow of goods can occur both "out" of and "in" to the same node, with a net flow of zero.

Question 1 options:

transhipment

transportation

FedEx

shortest path

Save

Question 2 (4 points)

Which of the following variables is considered random or probabilistic?

Question 2 options:

current price of bananas

last year’s advertising budget

future stock prices

historical interest rates

Save

Question 3 (4 points)

A service system has a constant service time, Poisson arrival rates and 1 server. What is the Kendall notation for this system?

Question 3 options:

M/D/1

D/M/1

M/G/1

M/M/1

Save

Question 4 (4 points)

Consider the following linear programming model:     Max: 4X12 + 2X2 + X3     Subject to: 2X1 + X2 £ 3 3X1 + X2 £ 1     X1, X2 ³ 0 What is causing this problem to violate one of the properties or assumptions for LP?

Question 4 options:

existancy

proportionality

indivisiblilty

nonlinearity

Save

Question 5 (4 points)

If the average arrival rate () is less than the average service rate (µ), this is called what in queue terminology?

Question 5 options:

steady state

markovian process

balking

poisson

Save

Question 6 (4 points)

A redundant constraint is eliminated from a linear programming model.  What effect will this have on the optimal solution?

Question 6 options:

feasible region will decrease in size

feasible region will double in size

a decrease in objective function value

none

Save

Question 7 (4 points)

In a product mix problem, a decision maker has limited availability of weekly labor hours. Labor hours would most likely constitute a constraint rather than a decision variable.

Question 7 options:

Save

Question 8 (4 points)

The constraint for a given resource is given by the following equation:  2X1 + 3X2 20.  If X1 = 3 and X2 = 1, how many units of this resource are unused?

Question 8 options:

11

6

4

0

Save

Question 9 (4 points)

If a decision model has two variables with random/probabilistic inputs, then the outcome of this model which is based on both variables will be deterministic.

Question 9 options:

Save

Question 10 (4 points)

Refer to the following information and output.

70%

What is the average number of customers in the queue?

Question 10 options:

3.26

.70

1.63

.23

Save

Question 11 (4 points)

Consider the following linear programming model:
Max 2X1 + 3X2
Subject to:
X1 2
X2 3
X1 1
X1, X2 0
This linear programming model has

Question 11 options:

alternate optimal solution

unbounded solution

redundant constraint

infeasible solution

Save

Question 12 (4 points)

Minimal spanning tree problems are solved by   enumerating possible outcomes with pencil and paper rather than using linear programming.

Question 12 options:

Save

Question 13 (4 points)

The markovian process utilizes what service rate?

Question 13 options:

exponential

general

poisson

deterministic

Save

Question 14 (4 points)

What is the constraint associated with job A for the following assignment problem?

            Machine

            1        2        3                           

       A  $3      $4      $2

Job B   $1      $3      $5  

       C    $6     $4      $2                                                                                                                                                                                                             Let Xij = 1 if job i is assigned to machine j, otherwise 0.

Question 14 options:

-XA1 - XA2 - XA3 = +1

3XA1 + 4XA2 + 2XA3 = -1

-XA1 - XA2 - XA3 = -1

-3XA1 - 4XA2 - 2XA3 = 1

Save

Question 15 (4 points)

Refer to the following information and output.

80%

What is the probability that the service facility servers are all busy?

Question 15 options:

.23

.80

.33

.20

Save

Question 16 (4 points)

The sum of the probabilities for all the experimental outcomes in a probability distribution will always be 1 (100%).

Question 16 options:

Save

Question 17 (4 points)

The arcs in this model have capacities that limit the amounts of flow that can occur on them.

Question 17 options:

shortest path

assingment

maximal-flow

transportation

Save

Question 18 (4 points)

This network model involves determining the maximum amount of material that can flow from one point (the source) to another point (the destination) in a network.

Question 18 options:

transportation

maximal-flow

assignment

solver

Save

Question 19 (4 points)

This network flow model has proved to be especially useful in helping firms decide where to locate a new factory or warehouse.

Question 19 options:

maximal-flow

minimal spanning tree

transportation

assignment

Save

Question 20 (4 points)

Simulations never generate optimal solutions.

Question 20 options:

Save

Question 21 (4 points)

Reneging refers to customers who

Question 21 options:

do not join a queue

join a queue but abandon their shopping carts before checking out

switch queues

eat cookies at the damaged shelf

Save

Question 22 (4 points)

In an unbalanced transportation problem where total demand exceeds total supply, the demand constraints will typically have “” inequalities in keeping with our convention of writing flows out of nodes with negative constraint coefficients and expressing the demand at the node as a negative number.

Question 22 options:

Save

Question 23 (4 points)

The Dakota pipeline would be an excellent example for using the maximal flow model to gain efficiency in the process.

Question 23 options:

Save

Question 24 (4 points)

The ending node of the shortest path problem has a demand value of +1 associated with it.

Question 24 options:

Save

Question 25 (4 points)

All supply and demand quantities in an maximal flow model equal transshipment nodes.

Question 25 options:

Save

transhipment

transportation

FedEx

shortest path

Explanation / Answer

Ans 2 future stock prices sicne it can be forecasted.

Ans 3 M/D/1

Ans 6 none

Ans 16 TRUE

As per chegg policy, we can answer max 4 MCQ's at a time.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.