Statistics and Probability

Which is a tree for the lottery (1/5, 200, 4/5, 1)?

Which is a tree for the lottery (1/5, 200, 4/5, 1)?

Which is a tree for the lottery (1/5, 200, 4/5, 1)?
  a.
  b.

Skoochy   37   1 Reply

irina99

The decision maker's preferences can be represented by an additive value function if ________. ...

The decision maker's preferences can be represented by an additive value function if ________. ...

The decision maker's preferences can be represented by an additive value function if ________.
  a.attribute 1 is pi with all other attributes.
  b.some of the attributes are pi.
  c.the set of attributes is mpi.
  d.attribute 1 i

koklok123   40   1 Reply

gool34

The Minimax Theorem shows ________. (Multiple Choice)

The Minimax Theorem shows ________. (Multiple Choice)

The Minimax Theorem shows ________.
  a.row's floor = column's ceiling.
  b.row's floor > column's ceiling.
  c.row's floor < column's ceiling.
  d.there is no relation between the row's floor and the column's ceiling.

bribery   68   1 Reply

Kojico

In order to assure an equilibrium point in a nonconstant-sum game ________.

In order to assure an equilibrium point in a nonconstant-sum game ________.

In order to assure an equilibrium point in a nonconstant-sum game ________.
  a.firms must not cooperate.
  b.only pure strategies must be allowed.
  c.firms must cooperate.
  d.a mixed strategy must be allowed.

NERD   42   1 Reply

scates8

Superadditivity is ________. (Multiple Choice)

Superadditivity is ________. (Multiple Choice)

Superadditivity is ________.
  a.
  b.

gracehiller11   47   1 Reply

clew0012

Which is NOT a cost involved in inventory models?

Which is NOT a cost involved in inventory models?

Which is NOT a cost involved in inventory models?
  a.holding
  b.hiring
  c.shortage
  d.ordering

NERD   64   1 Reply

al

For any value of q: a.there is no relation between TCk(q) and TCk-1(q). b.TCk(q) > TCk-1(q). ...

For any value of q: a.there is no relation between TCk(q) and TCk-1(q). b.TCk(q) > TCk-1(q). ...

For any value of q:
  a.there is no relation between TCk(q) and TCk-1(q).
  b.TCk(q) > TCk-1(q).
  c.TCk(q) < TCk-1(q).
  d.TCk(q) = TCk-1(q).

Nalu   39   1 Reply

tiss9889

The constant demand assumption is reasonable if: a.VC < 0.2. b.VC > 0.2. c.VC < 0.5. ...

The constant demand assumption is reasonable if: a.VC < 0.2. b.VC > 0.2. c.VC < 0.5. ...

The constant demand assumption is reasonable if:
  a.VC < 0.2.
  b.VC > 0.2.
  c.VC < 0.5.
  d.VC > 0.5.

stroman54   69   1 Reply

kwengert

Which EOQ model does NOT have an optimal algebraic solution?

Which EOQ model does NOT have an optimal algebraic solution?

Which EOQ model does NOT have an optimal algebraic solution?
  a.continuous rate model
  b.quantity discount model
  c.multiple-product EOQ
  d.EOQ with back orders

bribery   49   2 Replies

bribery

In the news vendor problem cu is the ________.

In the news vendor problem cu is the ________.

In the news vendor problem cu is the ________.
  a.underuse cost.
  b.unemployment cost.
  c.understocking cost.
  d.underorder cost.

gracehiller11   49   1 Reply

alarose

In the EOQ with uncertain demand model P() is ________.

In the EOQ with uncertain demand model P() is ________.

In the EOQ with uncertain demand model P() is ________.
  a.the probability that a stockout will occur during a lead time.
  b.the order quantity for the case without back

Acostak1   71   1 Reply

DCAV1

SLM1 is: a.the expected fraction of cycles during which demand is met on time. b.the expected ...

SLM1 is: a.the expected fraction of cycles during which demand is met on time. b.the expected ...

SLM1 is:
  a.the expected fraction of cycles during which demand is met on time.
  b.the expected demand not met on time.
  c.the expected fraction of all demand that is met on time.
  d.the expected number of cycles pe

Brutusandmoose   56   1 Reply

ccopp

According to the diagram, which two states communicate? a.2, 4 b.1,3 c.3, 4 d.4, 5

According to the diagram, which two states communicate? a.2, 4 b.1,3 c.3, 4 d.4, 5

According to the diagram, which two states communicate?
 
 

  a.2, 4
  b.1,3
  c.3, 4
  d.4, 5

kate lynn   52   1 Reply

JMENDEZ

If , , then m11 = a.7/2. b.1 c.7/5. d.2/7.

If , , then m11 = a.7/2. b.1 c.7/5. d.2/7.

If , , then m11 =
  a.7/2.
  b.1
  c.7/5.
  d.2/7.

Theleeman   50   1 Reply

kimmaz

Which is not a characteristic of dynamic programming?

Which is not a characteristic of dynamic programming?

Which is not a characteristic of dynamic programming?
  a.The decision at any stage is independent of the other stages.
  b.Each stage has a number of states associated with it.
  c.A problem can be divided into stages with a decision

Nalu   62   1 Reply

al

In the resource-allocation problem the benefit obtained from more than one activity is a.the ratio ...

In the resource-allocation problem the benefit obtained from more than one activity is a.the ratio ...

In the resource-allocation problem the benefit obtained from more than one activity is
  a.the ratio of the benefits obtained from the individual activities.
  b.the quotient of the benefits obtained from the individual activities.
  c

Haydena   88   2 Replies

Haydena

Equipment replacement problems a.determine how often equipment should be repaired. b.determine how ...

Equipment replacement problems a.determine how often equipment should be repaired. b.determine how ...

Equipment replacement problems
  a.determine how often equipment should be repaired.
  b.determine how a machine should be recycled.
  c.determine how a machine should be repaired.
  d.determine how long a machine should be utiliz

rgasio   91   1 Reply

Kojico

Which is not an aspect of recursion?

Which is not an aspect of recursion?

Which is not an aspect of recursion?
  a.We must specify how to best move from stage t to stage t+1.
  b.We must specify how the state at stage t+1 depends on the value of t, the state at stage t and the decision chosen at stage t.
  c

kate lynn   78   1 Reply

whitneyracquel

Which is not a description of the dynamic lot-size model?

Which is not a description of the dynamic lot-size model?

Which is not a description of the dynamic lot-size model?
  a.There is a limit on ci.
  b.Demand for period t must be met on time.
  c.Demand dt is know at the beginning of period t.
  d.There is no limit on

NERD   75   1 Reply

JMENDEZ

The program that solves DP recursions is called a.LINGO. b.LINDO. c.no dynamic programming ...

The program that solves DP recursions is called a.LINGO. b.LINDO. c.no dynamic programming ...

The program that solves DP recursions is called
  a.LINGO.
  b.LINDO.
  c.no dynamic programming computer package exists.
  d.Excel Solver.

bribery   91   1 Reply

Bflint101

PDP stands for a.probabilistic dynamic programming. b.portrayed dynamic programming. c.possible ...

PDP stands for a.probabilistic dynamic programming. b.portrayed dynamic programming. c.possible ...

PDP stands for
  a.probabilistic dynamic programming.
  b.portrayed dynamic programming.
  c.possible dynamic programming.
  d.probability dynamic programming.

fundai!   107   1 Reply

gomeza

If a favorable event occurs we assign a reward of a.2. b.0. c.1. d.1.

If a favorable event occurs we assign a reward of a.2. b.0. c.1. d.1.

If a favorable event occurs we assign a reward of
  a.2.
  b.0.
  c.1.
  d.1.

sdaggy1   73   1 Reply

Macdonaldc

Problems in which the decision maker can terminate the problem by choosing a particular action are ...

Problems in which the decision maker can terminate the problem by choosing a particular action are ...

Problems in which the decision maker can terminate the problem by choosing a particular action are called
  a.completion early problems.
  b.ending action problems.
  c.terminating stage problems.
  d.stopping rule problems.

cmsx27   81   1 Reply

wping

Which question cannot be answered by queuing theory?

Which question cannot be answered by queuing theory?

Which question cannot be answered by queuing theory?
  a.What fraction of time is each server idle?
  b.What is the probability distribution of a customer's waiting time?
  c.What is the expected number of customers that leave the queu

alexisblack   77   1 Reply

umass508

Which is not a queue discipline?

Which is not a queue discipline?

Which is not a queue discipline?
  a.FCFS
  b.SIRO
  c.LCFS
  d.FIRO

arichman7730   81   1 Reply

DCAV1

If for a queue that achieves steady state, then Lq = a.1/3 b.1/6 c.1/2 d.1/9

If for a queue that achieves steady state, then Lq = a.1/3 b.1/6 c.1/2 d.1/9

If  for a queue that achieves steady state, then Lq =
  a.1/3
  b.1/6
  c.1/2
  d.1/9

ANP2202   76   1 Reply

lsellers6

The main difference between an M/M/1/GD// and an M/M/1/GD/c/ queuing system is a.W will be larger ...

The main difference between an M/M/1/GD// and an M/M/1/GD/c/ queuing system is a.W will be larger ...

The main difference between an M/M/1/GD// and an M/M/1/GD/c/

jldobro   71   1 Reply

sophiakhalid12

A k-stage series queuing system will blow up if

A k-stage series queuing system will blow up if

A k-stage series queuing system will blow up if
  a. for some j=1, 2, ..., k..
  b.

Skoochy   72   1 Reply

Kojico

In an M/G/s/GD/s/ system Wq = a.0. b.. c.W. d.Ws.

In an M/G/s/GD/s/ system Wq = a.0. b.. c.W. d.Ws.

In an M/G/s/GD/s/ system Wq =
  a.0.
  b..
  c.W.
  d.Ws.

LRotundo   62   2 Replies

LRotundo

In a closed queuing network a.there are no steady state probabilities. b.there is a unique ...

In a closed queuing network a.there are no steady state probabilities. b.there is a unique ...

In a closed queuing network
  a.there are no steady state probabilities.
  b.there is a unique solution for Pij, the probability that a job will travel from server i to server j.
  c.there is a variable number of jobs in the

jldobro   112   1 Reply

Bubbbles

When the parameters defining the queuing system vary over time, the system is a.open. b.blocked. ...

When the parameters defining the queuing system vary over time, the system is a.open. b.blocked. ...

When the parameters defining the queuing system vary over time, the system is
  a.open.
  b.blocked.
  c.FCFS.
  d.nonstationary.

RENCEE72   100   1 Reply

Bubbbles

Which is not a term used in simulation?

Which is not a term used in simulation?

Which is not a term used in simulation?
  a.state variables
  b.system
  c.entity
  d.noninteger program

slapaburger   107   1 Reply

Macdonaldc

A simulation that contains one or more random variables is called a ________ simulation. ...

A simulation that contains one or more random variables is called a ________ simulation. ...

A simulation that contains one or more random variables is called a ________ simulation.
  a.deterministic
  b.stochastic
  c.static
  d.deterministic

stroman54   121   1 Reply

WillGross3

The basic distribution in random number generation is a.Poisson(4). b.U(0,1). c.Normal(0,1). ...

The basic distribution in random number generation is a.Poisson(4). b.U(0,1). c.Normal(0,1). ...

The basic distribution in random number generation is
  a.Poisson(4).
  b.U(0,1).
  c.Normal(0,1).
  d.Exponential(1).

CTaustin   109   2 Replies

CTaustin

Statistical analysis is performed on simulation models to determine a.the warm-up period. b.the ...

Statistical analysis is performed on simulation models to determine a.the warm-up period. b.the ...

Statistical analysis is performed on simulation models to determine
  a.the warm-up period.
  b.the level of autocorrelation.
  c.the confidence interval.
  d.the steady-state level.

gracehiller11   109   1 Reply

vbass

Which is not a simulation language?

Which is not a simulation language?

Which is not a simulation language?
  a.SLAM
  b.GPSS
  c.GASP
  d.GRSP

Haydena   105   1 Reply

kimmaz

In an M/M/1 queue service times are a.Erlang. b.normal. c.exponential. d.Poisson.

In an M/M/1 queue service times are a.Erlang. b.normal. c.exponential. d.Poisson.

In an M/M/1 queue service times are
  a.Erlang.
  b.normal.
  c.exponential.
  d.Poisson.

alexisblack   129   1 Reply

JMENDEZ

Which measure is not tracked on-screen?

Which measure is not tracked on-screen?

Which measure is not tracked on-screen?
  a.Value Added Time
  b.quantity processed
  c.Waiting time
  d.Cycle Time

Theleeman   128   1 Reply

vbass

To change from an M/M/1 queue to an M/M/2 queue, which option on the Activity dialog box is ...

To change from an M/M/1 queue to an M/M/2 queue, which option on the Activity dialog box is ...

To change from an M/M/1 queue to an M/M/2 queue, which option on the Activity dialog box is modified?
  a.capacity
  b.Output Queue Capacity
  c.Input Queue Capacity
  d.time

ejohnson3310   97   1 Reply

suarezs1

When creating a series system, which is not a change that must be made to the M/M/1 system? ...

When creating a series system, which is not a change that must be made to the M/M/1 system? ...

When creating a series system, which is not a change that must be made to the M/M/1 system?
  a.Insure that 100 of all customers must receive service at each task.
  b.Create a process rectangle for each task in the series system.
  c.

CTaustin   89   1 Reply

irina99