The objective of a linear programming problem is to maximize 1.50X + 1.50Y, subject to 3X + 2Y 600, 2X + 4Y 600, and X,Y 0. What is the optimal (best) value of the objective function, subject to the constraints and rounded to the nearest whole number?

a)225

b)300

c)338

d)425

e)500

A firm makes two products, A and B. Each unit of A costs $10 and sells for $30. Each unit of B costs $5 and sells for $20. If the firm's goal were to maximize profit, what would be the appropriate objective function?

a)Maximize profit = $40A - $25B

b)Maximize profit = $40A + $25B

c)Maximize profit = $20A + $15B

d)Maximize profit = 0.25A + 0.20B

e)Maximize profit = $50(A + B)

With respect to queuing theory, the potential restaurant customer who says to her husband, "The line looks too long; let's eat somewhere else," is an illustration of which element of arrival behavior?

a)first-in, first-out

b)balk

c)renege

d)random departure

e)frustration

In queuing problems, which of the following probability distributions is typically used to describe the number of arrivals per unit of time a)binomial

b)normal

c)Poisson

d)exponential

e)lognorm