1046 Words Mar 10th, 2015 5 Pages
Question 1

A feasible solution violates at least one of the constraints. Answer True False
2 points
Question 2

A linear programming model consists of only decision variables and constraints. Answer True False
2 points
Question 3

The following inequality represents a resource constraint for a maximization problem: X + Y ≥ 20 Answer True False
2 points
Question 4

In minimization LP problems the feasible region is always below the resource constraints. Answer True False
2 points
Question 5

In a linear programming problem, all model parameters are assumed to be known with certainty.
Profit for each big shelf is \$300 and for each medium shelf is \$150. What is the storage space constraint?

90B + 100M ≥ 18000 90B + 100M ≤ 18000 100B + 90M ≤ 18000 500B + 300M ≤ 18000
2 points
Question 10

Which of the following statements is not true?

An infeasible solution violates all constraints. A feasible solution point does not have to lie on the boundary of the feasible solution. A feasible solution satisfies all constraints. An optimal solution satisfies all constraints.
2 points
Question 11

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*.

The equation for constraint DH is:

4X + 8Y ≥ 32 8X + 4Y ≥ 32 X + 2Y ≥ 8 2X + Y ≥ 8 2 points
Question 12

Decision variables

measure the objective function measure how much or how many items to produce, purchase, hire, etc. always exist for each constraint measure the values of each constraint
2 points
Question 13

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*.

Which of the following points are not feasible?