# MAT 540 Quiz 3 100 Out of 100 A++++++++++++

(Not rated)
(Not rated)
Chat

·         Question 1

2 out of 2 points

 A feasible solution violates at least one of the constraints.

2 out of 2 points

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

·         Question 3

2 out of 2 points

Graphical solutions to linear programming problems have an infinite number of possible objective function lines.

·         Question 4

2 out of 2 points

The following inequality represents a resource constraint for a maximization problem:
X + Y ≥ 20

·         Question 5

2 out of 2 points

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

·         Question 6

2 out of 2 points

Surplus variables are only associated with minimization problems.

·         Question 7

2 out of 2 points

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

·         Question 8

2 out of 2 points

 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 constraints has a surplus greater than 0?

·         Question 9

2 out of 2 points

The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular and diet. 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. For the production combination of 135 cases of regular and 0 cases of diet soft drink, which resources will not be completely used?

·         Question 10

2 out of 2 points

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?

 S

·         Question 11

2 out of 2 points

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 the limited resources are production time (8 hours = 480 minutes per day) and syrup 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 time constraint?

·         Question 12

2 out of 2 points

In a linear programming problem, the binding constraints for the optimal solution are:
5x1 + 3x2 ≤ 30
2x1 + 5x2 ≤ 20
Which of these objective functions will lead to the same optimal solution?

·         Question 13

2 out of 2 points

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:

·         Question 14

2 out of 2 points

Decision variables

·         Question 15

2 out of 2 points

In a linear programming problem, a valid objective function can be represented as

 S

·         Question 16

2 out of 2 points

 Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs \$500 and requires 100 cubic feet of storage space, and each medium shelf costs \$300 and requires 90 cubic feet of storage space. The company has \$75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is \$300 and for each medium shelf is \$150. What is the maximum profit?Answer

·         Question 17

2 out of 2 points

 The linear programming problem:   MIN Z =          2x1 + 3x2  Subject to:       x1 + 2x2 ≤ 20                          5x1 + x2 ≤ 40                          4x1 +6x2 ≤ 60                          x1 , x2 ≥ 0 ,Answer

·         Question 18

2 out of 2 points

A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function.

What would be the new slope of the objective function if multiple optimal solutions occurred along line segment AB? Write your answer in decimal notation.

·         Question 19

2 out of 2 points

Consider the following minimization problem:
Min z =     x
1 + 2x2
s.t.             x
+ x2 ≥ 300
2x
1 + x2 ≥ 400
2x
1 + 5x2 ≤ 750
x
1, x2 ≥ 0

Find the optimal solution. What is the value of the objective function at the optimal solution? Note: The answer will be an integer. Please give your answer as an integer without any decimal point. For example, 25.0 (twenty five) would be written 25

 Evaluation Method Correct Answer Case Sensitivity

·         Question 20

2 out of 2 points

Max Z =    \$3x + \$9y
Subject to:       20x + 32y ≤ 1600
4x + 2y ≤ 240
y ≤ 40
x, y ≥ 0
At the optimal solution, what is the amount of slack associated with the second constraint?

 Evaluation Method Correct Answer Case Sensitivity

• 9 years ago
MAT 540 Quiz 3 100 Out of 100 A++++++++++++
NOT RATED

Purchase the answer to view it

• quiz_3_version_1_new.doc