Linear programming homework help

Question 1 of 20

1.0 Points

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

 A. 2x1 + 1x2

 B. 7x1 + 8x2

 C. 25x1 + 15x2

 D. 80x1 + 60x2

Reset Selection

Question 2 of 20

1.0 Points

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

 A. Max 3x + 3y + 1/3 z

 B. Min (x1 + x2) / x3

 C. Max Z = 5xy

 D. Max Z 5x2 + 2y2

Reset Selection

Question 3 of 20

1.0 Points

A linear programming model consists of

 A. constraints.

 B. decision variables.

 C. an objective function.

 Dall of the above

Reset Selection

Question 4 of 20

1.0 Points

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

 A. Z = 1A + 2B2 + 3D

 B. Z = 1A + 2B / C + 3D

 C. Z = 1A + 2B + 3C + 4D

 D. Z = 1A + 2BC + 3D

Reset Selection

Question 5 of 20

1.0 Points

The production manager for the Coory soft drink company is considering the production of two 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 (1 of the 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 time constraint?

 A. 2R + 3D â‰¤ 480

 B. 2D + 4R â‰¤ 480

 C. 2R + 4D â‰¤ 480

 D. 3R + 2D â‰¤ 480

Reset Selection

Question 6 of 20

1.0 Points

Cully Furniture buys two 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 $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the objective function?

 A. MAX Z = $300 B + $150 M

 B. MAX Z = $300 B + $500 M

 C. MAX Z = $300 B + $100 M

 D. MAX Z = $300 M + $150 B

Reset Selection

Question 7 of 20

1.0 Points

The ________ property of linear programming models indicates that the decision variables cannot be restricted to integer values and can take on any fractional value.

 A. divisibility

 B. additive

 C. proportionality

 D. linearity

Reset Selection

Question 8 of 20

1.0 Points

The ________ property of linear programming models indicates that the values of all the model parameters are known and are assumed to be constant.

 A. certainty

 B. divisibility

 C. proportionality

 D. additive

Reset Selection

Question 9 of 20

1.0 Points

Which of these statements is best?

 A. An unbounded problem has feasible solutions.

 B. An infeasible problem is also unbounded.

 C. An unbounded problem is also infeasible.

 D. An infeasible problem has unbounded solutions.

Reset Selection

Question 10 of 20

1.0 Points

The production manager for the Coory soft drink company is considering the production of two 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 the 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. Which of the following is not a feasible production combination?

 A. 90R and 75D

 B. 75R and 90D

 C. 40R and 100D

 D. 135R and 0D

Reset Selection

Question 11 of 20

1.0 Points

Cully Furniture buys two 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 $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the maximum profit?

 A. $35,000

 B. $65,000

 C. $55,000

 D. $45,000

Reset Selection

Question 12 of 20

1.0 Points

Cully Furniture buys two 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 $75,000 to invest in shelves this week, and the warehouse has 18,000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. In order to maximize profit, how many big shelves (B) and how many medium shelves (M) should be purchased?

 A. B = 150, M = 0

 B. B = 100, M = 100

 C. B = 0, M = 200

 D. B = 90, M = 75

Reset Selection

Question 13 of 20

1.0 Points

Consider the following maximization problem.MAX z = x + 2ys.t.2x + 3y â‰¤ 65x + 6y â‰¤ 30y≥ 1
The optimal solution

 A. occurs where x = 6 and y = 0.

 B. occurs where x = 0 and y = 2.

 C. results in an objective function value of 12.

 D. occurs where x = 4.67 and y = 1.11.

Reset Selection

Question 14 of 20

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

The equation for constraint DH is:

 A. 4X + 8Y â‰¥ 32

 B. X + 2Y â‰¥ 8

 C. 8X + 4Y â‰¥ 32

 D. 2X + Y â‰¥ 8

Reset Selection

Question 15 of 20

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

Which line is represented by the equation 2X + Y â‰¥ 8?

 A. CG

 B. AJ

 C. DH

 D. BF

Reset Selection

Question 16 of 20

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

The constraint AJ

 A. does not contain feasible points.

 B. contains the optimal solution.

 C. is a binding constraint.

 D. has no surplus.

Reset Selection

Question 17 of 20

1.0 Points

The production manager for the Coory soft drink company is considering the production of two 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 the 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?

 A. time and syrup

 B. only time

 C. only syrup

 D. neither time nor syrup

Reset Selection

Question 18 of 20

1.0 Points

Consider the following linear program:MAX z = 5x + 3ys.t.x– y â‰¤ 6x â‰¤ 1The optimal solution

 A. results in an objective function value of 5.

 B. is infeasible.

 C. occurs where x = 0 and y = 1.

 D. occurs where x = 1 and y = 0.

Reset Selection

Question 19 of 20

1.0 Points

The optimal solution of a minimization problem is at the extreme point ________ the origin.

 A. parallel to

 B. farthest from

 C. closest to

 D. exactly at

Reset Selection

Question 20 of 20

1.0 Points

Multiple optimal solutions occur when constraints are parallel to each other.

 A. True

 B. False