A) Max 5 XY
B) Min 4X + 3Y + 6Z
C) Max 5X2 + 6Y4
D) Min (X1+X2) / 3
A) the amount by which the left side of the constraint is smaller than the right side
B) the difference between the left and right sides of a constraint
C) the amount by which the left side of the constraint is larger than the right side
D) Exists for each variable in a linear programming problem
Optimal
Feasible
Infeasible
Semi-feasible
Real system
Computer Model
Performance Measures
Estimated inference
Describes future behavior of the system
Optimizes the system
Leads to higher order decision making
All of the alternatives are true.
Each server has its own queue
Each server has the same service rate
µ > λ
All of the alternatives are correct
M + n
M X n
M + n -1
M + n +1
Requires that only one activity be assigned to each sequence
Is a special case of transportation problems
Can be used for maximization objective
All of the above.
ϱ / 1-ϱ
λ 2 / µ - λ
1/ µ - λ
ρ2 / 1-ρ
Arrival pattern
Service pattern
Number of services
Capacity of the system
Backing
Reneging
Jockeying
Alternating
Equal to zero
Most negative number
Most positive number.
Any value
Add a dummy row
Add a dummy column
Remove a row or column depending upon the given situation
Add a dummy row or column depending upon a given situation.
Modern distributions
Markov distributions Method
Modified Distribution Method
Model Index method
- ∞
0
Negative
∞
Simplex Method
Graphical Method
Vector Method
Hungarian Method
Model building
Obtain alternate solutions
Interpreting the variables
Formulation of the problem
R2 = R1 X P2
R2 = P X R1
R2 = R0 X P2
None of the above
Not necessary to assign the exact range of random numbers
Necessary to use particular random numbers
Necessary to find out cumulative probability distribution
None of the above
Arrival rate divided by service rate
Service rate divided by arrival rate
Length in the system divided by length in the queue
Waiting time in system divided by waiting time in queue