Free Full Course Please Donate Other Courses I Have Full Works

986 Words Jul 29th, 2014 4 Pages
MAT 540 Quiz 3

1. If the objective function is parallel to a constraint, the constraint is infeasible.

[pic]True

[pic]False

2. In minimization LP problems the feasible region is always below the resource constraints.

[pic]True

[pic]False

3. Surplus variables are only associated with minimization problems.

[pic]True

[pic]False

4. A linear programming model consists of only decision variables and constraints.

[pic]True

[pic]False

5. In a linear programming problem, all model parameters are assumed to be known with certainty.

[pic]True

[pic]False

6. A linear programming problem may have more than one set of solutions.

[pic]True

[pic]False

7. The following inequality represents a resource constraint for a maximization
…show more content…
Profit for each big shelf is $300 and for each medium shelf is $150. What is the storage space constraint?

|[pic]| |90B + 100M ≥ 18000 |

|[pic]| |90B + 100M ≤ 18000 |

|[pic]| |100B + 90M ≤ 18000 |

|[pic]| |500B + 300M ≤ 18000 |

11. The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet (D). Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the objective function?

|[pic]| |MAX $2R + $4D |

|[pic]| |MAX $3R + $2D |

|[pic]| |MAX $3D + $2R |

|[pic]| |MAX $4D + $2R |

12. The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.

[pic]

Which of the following points are not feasible?

|[pic]| |A |

|[pic]| |J |

|[pic]| |H |

|[pic]| |G |

13. Which of the following could be a linear programming objective function?

|[pic]| |Z = 1A + 2BC + 3D |

|[pic]| |Z = 1A + 2B + 3C + 4D |

|[pic]| |Z = 1A + 2B / C + 3D |

|[pic]| |all of the above |

14. The production manager for the Coory soft drink company is considering the production of 2 kinds of soft

Related Documents