Linear programming homework help

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

Reset Selection

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

Reset Selection

A linear programming model consists of

Reset Selection

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

Reset Selection

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?

Reset Selection

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?

Reset Selection

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

Reset Selection

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

Reset Selection

Which of these statements is best?

Reset Selection

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?

Reset Selection

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?

Reset Selection

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?

Reset Selection

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

Reset Selection

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:

Reset Selection

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?

Reset Selection

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

Reset Selection

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?

Reset Selection

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

Reset Selection

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

Reset Selection

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