Question

The following is the mathematical model of a linear programming problem for profit: Maximize subject to...

The following is the mathematical model of a linear programming problem for profit:

Maximize subject to

Z = 2X1 + 3X2

4X1+9X2 ≤ 72 10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153

X1 , X2 ≥ 0

The constraint lines have been graphed below along with one example profit line (dashed). The decision variable X1 is used as the X axis of the graph. Use this information for questions
19 through 23.

A). Which of the following gives the constraint line that cuts the X2 axis at X2 = 17?

A. B. C. D. E.

Z = 2X1 + 3X2 4X1+9X2≤ 72

10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153

X1 , X2 ≥ 0

B). The example profit line cuts the X1 axis at X1 = 9. What is the example profit amount?

3
6
9
18
None of the above

Y coordinate plane has four quadrants to its graph. Here is shown only the first

C). The X,
quadrant (positive X, positive Y). Which of the following determines this?

A. B. C. D. E.

A. B. C. D. E.

Z=2X1+3X2 4X1+9X2≤ 72 10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153

X1 , X2 ≥ 0


D). The optimal solution is X1 = 4.3 and X2 = 6.1. What is the maximum total profit?

8.6
10.4
18.3
26.9
None of the above

E). At the
constraint 17X1 + 9X2 ≤ 153 is

optimal solution given in question 22 above, the value of the slack variable for the

  1. -25

  2. 0

  3. 25

  4. 14.4

  5. None of the above

Homework Answers

Answer #1

I guess the sequence of questions and their options are not right.

I have solved on eexample in r

> library(lpSolve)
> f.obj <- c(2, 3)
> f.con <- matrix(c(4, 9,
+ 10, 11,
+ 17, 9), nrow = 3, byrow = TRUE)
> f.dir <- c("<=",
+ "<=",
+ "<=")
> f.rhs <- c(72,
+ 110,
+ 153)
> lp("max", f.obj, f.con, f.dir, f.rhs)
Success: the objective function is 26.86957
> lp("max", f.obj, f.con, f.dir, f.rhs)$solution
[1] 4.304348 6.086957

Hence the answer of question D is 26.9

E )

optimal solution given in question 22 above, the value of the slack variable for the -25

lp("max", c(1,1),f.con, c("<=", "<=", "="), c(72,110, -25))$solution is 0

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
The following is the mathematical model of a linear programming problem for profit: Maximize Z =...
The following is the mathematical model of a linear programming problem for profit: Maximize Z = 2X1 + 3X2 subject to: 4X1 + 9X2 ≤ 72 10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153 X1 , X2 ≥ 0 The constraint lines have been graphed below along with one example profit line (dashed). The decision variable X1 is used as the X axis of the graph. Which of the following gives the constraint line that cuts the X2...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2 ≤ 4      5x1+ 3x2 ≤15       x1,x2 ≥ 0 Graph the region that satisfies the constraints. Find the optimal solution and the value of the objective function at the optimal solution.
a. Solve the following linear programming model by using the graphical method: graph the constraints and...
a. Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region then determine the optimal solution (s) (show your work). Minimize Z = 3x1 + 7x2 Subject to 9x1 + 3x2 ≥ 36 4x1 + 5x2 ≥ 40 x1 – x2 ≤ 0 2x1 ≤ 13 x1, x2 ≥ 0 b. Are any constraints binding? If so, which one (s)?
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 +...
Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject To X1 + X2 ≤ 4 Constraint A X1 - X2 ≤ 1 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Answer CorrectNot Correct Z - X1...
Maximize 12X1 + 10X2 + 8X3             Total Profit Subject to      X1 + X2 + X3 >...
Maximize 12X1 + 10X2 + 8X3             Total Profit Subject to      X1 + X2 + X3 > 160        At least a total of 160 units of all three products needed                  X1 + 3X2 + 2X3 ≤ 450         Resource 1                  2X1 + X2 + 2X3 ≤ 300         Resource 2                2X1 + 2X2 + 3X3 ≤ 400         Resource 3                   And X1, X2, X3 ≥ 0 Where X1, X2, and X3 represent the number of units of Product 1, Product...
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region. Using the corner points method, determine the optimal solution (s) (show your work). Maximize Z = 6.5x1 + 10x2 Subject to x1 + x2 ≤ 15 2x1 + 4x2 ≤ 40 x1 ≥ 8 x1, x2 ≥ 0 b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect does this have on the optimal solution? Are...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Minimize Z = 2x1 + 3x2 Subject to             4x1 + 2x2 ≥ 20             2x1 + 6x2 ≥ 18               x1 + 2x2 ≤ 12 x1, x2  ≥ 0 with solution! thak you so much :D
Consider the following linear programming problem. Maximize        6X1 + 4X2 Subject to:                     &nbs
Consider the following linear programming problem. Maximize        6X1 + 4X2 Subject to:                         X1 + 2X2 ≤ 16                         3X1 + 2X2 ≤ 24                         X1  ≥ 2                         X1, X2 ≥ 0 Use Excel Solver to find the optimal values of X1 and X2. In other words, your decision variables: a. (10, 0) b. (12, 2) c. (7, 5) d. (0, 10)
solve the following model graphically: maximize 2x1 +7x2 subject to: 9x1 +7x2 ≤ 63 5x1 +8x2...
solve the following model graphically: maximize 2x1 +7x2 subject to: 9x1 +7x2 ≤ 63 5x1 +8x2 ≤ 40 9x1 −15x2 ≥ 0 x1 ≥ 3 x2 ≤ 4 x1, x2 ≥ 0 Take care to identify and label the feasible region, feasible points, optimal isovalue line and use algebra to determine the optimal solution.
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...