MAT540 – Quiz – 3

Question 1

1.

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

Answer[removed] True
[removed] False

ORDER NOW FOR CUSTOMIZED SOLUTION PAPERS

2 points   

Question 2

1.

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

Answer[removed] True
[removed] False

2 points   

Question 3

1.

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

Answer[removed] True
[removed] False

2 points   

Question 4

1.

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

Answer[removed] True
[removed] False

2 points   

Question 5

1.

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

Answer[removed] True
[removed] False

2 points   

Question 6

1.

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

Answer[removed] True
[removed] False

2 points   

Question 7

1.

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

Answer[removed] True
[removed] False

2 points   

Question 8

1.

Decision variables

Answer

[removed] measure the objective function
[removed] measure how much or how many items to produce, purchase, hire, etc.
[removed] always exist for each constraint
[removed] measure the values of each constraint

2 points   

Question 9

1.

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:

Answer

[removed] 4X + 8Y ≥ 32
[removed] 8X + 4Y ≥ 32
[removed] X + 2Y ≥ 8
[removed] 2X + Y ≥ 8
 

2 points   

Question 10

1.

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

Answer

[removed] 2×1 + 1×2
[removed] 7×1 + 8×2
[removed] 80×1 + 60×2
[removed] 25×1 + 15×2

2 points   

Question 11

1.

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?

Answer

[removed] MAX $2R + $4D
[removed] MAX $3R + $2D
[removed] MAX $3D + $2R
[removed] MAX $4D + $2R

2 points   

Question 12

1.

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?

Answer

[removed] 2R + 5D ≤ 480
[removed] 2D + 4R ≤ 480
[removed] 2R + 3D ≤ 480
[removed] 2R + 4D ≤ 480

2 points   

Question 13

1.

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

[removed] $25000
[removed] $35000
[removed] $45000
[removed] $55000
[removed] $65000

2 points   

Question 14

1.

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?

Answer

[removed] A
[removed] J
[removed] H
[removed] G

2 points   

Question 15

1.

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

 
This linear programming problem is a:

Answer

[removed] maximization problem
[removed] minimization problem
[removed] irregular problem
[removed] cannot tell from the information given

2 points   

Question 16

1.

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.

If this is a maximization, which extreme point is the optimal solution?

Answer

[removed] Point B
[removed] Point C
[removed] Point D
[removed] Point E

2 points   

Question 17

1.

The linear programming problem:

MIN Z =          2×1 + 3×2
Subject to:       x1 + 2×2 ≤ 20
5×1 + x2 ≤ 40
4×1 +6×2 ≤ 60
x1 , x2 ≥ 0 ,

Answer

[removed] has only one solution.
[removed] has two solutions.
[removed] has an infinite number of solutions.
[removed] does not have any solution.

2 points   

Question 18

1.

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.
 

Answer[removed]

2 points   

Question 19

1.

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?

Answer[removed]

2 points   

Question 20

1.

Solve the following graphically
Max z =     3x1 +4x
s.t.             x1 + 2x≤ 16
2x1 + 3x2 ≤ 18
x1    ≥ 2
x2    ≤ 10
x1, 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
 

Back to School Offer

Get 15% of Your First Order amount back in Reward Credits!

Free Inquiry