Question

Consider the problem Min 3X2 – 22X + 2XY + Y2 – 16Y + 60 s.t....

Consider the problem

Min 3X2 – 22X + 2XY + Y2 – 16Y + 60
s.t. X + 5Y ≤ 8
  1. Find the minimum solution to this problem. If required, round your answers to two decimal places.

    The optimal solution is X = , Y = , for an optimal solution value of .
  2. If the right-hand side of the constraint is increased from 8 to 9, how much do you expect the objective function to change? If required, round your answer to two decimal places.

    The optimal objective function value will
    • increase
    • decrease
    by .
  3. Re-solve the problem with a new right-hand side of 9. How does the actual change compare with your estimate? If required, round your answers to two decimal places.

    The new optimal objective function value is so the actual
    • increase
    • decrease
    is .
Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

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

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider this problem and answer the following questions. Maximize      Z = 2x1 + 3x2           s.t....
Consider this problem and answer the following questions. Maximize      Z = 2x1 + 3x2           s.t.                                x1   +   2x2 <= 30                                x1    +    x2   <= 20                                x1,          x2   >= 0 Solve the problem graphically in a free hand manner and identify all the CPFs. Use hand calculation to solve the problem by the simplex method in algebraic form Additional: What can you say about the solution if the RHS of the second constraint was 16? (i. e....
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...
Consider the following linear programming problem: Max 8X + 7Y s.t. 15X + 5Y ≤ 75...
Consider the following linear programming problem: Max 8X + 7Y s.t. 15X + 5Y ≤ 75 10X + 6Y ≤ 60 X + Y ≤ 8 X, Y ≥ 0 The optimal value of the objective function is ________. A)59 B)61 C)58 D)60
2. The following linear programming problem has been solved by The Management Scientist. Use the output...
2. The following linear programming problem has been solved by The Management Scientist. Use the output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 25X1+30X2+15X3 S.T. 1) 4X1+5X2+8X3<1200 2) 9X1+15X2+3X3<1500 OPTIMAL SOLUTION Objective Function Value = 4700.000 Variable Variable Reduced Cost X1 140.000   0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint   Slack/Surplus Dual Price 1   0.000   1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES Variable   Lower Limit Current Value Upper Limit X1 19.286 25.000 45.000 X2 No Lower Limit 30.000 40.000...
) Consider the linear program in Problem 1. The value of the optimal solution is 27....
) Consider the linear program in Problem 1. The value of the optimal solution is 27. Suppose that the right-hand side for constraint 1 is increased from 10 to 11. a. Use the graphical solution procedure to find the new optimal solution. b. Use the solution to part (a) to determine the shadow price for constraint 1. c. The sensitivity report for the linear program in Problem 1 provides the following right- hand-side range information: Constraint Constraint R.H side Allowable...
1- An unbounded problem is one for which ________. remains feasible A. the objective is maximized...
1- An unbounded problem is one for which ________. remains feasible A. the objective is maximized or minimized by more than one combination of decision variables B. there is no solution that simultaneously satisfies all the constraints C. the objective can be increased or decreased to infinity or negative infinity while the solution D. there is exactly one solution that will result in the maximum or minimum objective 2- If a model has alternative optimal solutions, ________. A. the objective...
Use Euler's method to approximate y(1.2), where y(x) is the solution of the initial-value problem x2y''...
Use Euler's method to approximate y(1.2), where y(x) is the solution of the initial-value problem x2y'' − 2xy' + 2y = 0,  y(1) = 9,  y'(1) = 9, where x > 0. Use h = 0.1. Find the analytic solution of the problem, and compare the actual value of y(1.2) with y2. (Round your answers to four decimal places.) y(1.2) ≈     (Euler approximation) y(1.2) =     (exact value)
Consider the following initial value problem. y′ + 5y  = { 0 t  ≤  2 10...
Consider the following initial value problem. y′ + 5y  = { 0 t  ≤  2 10 2  ≤  t  <  7 0 7  ≤  t  <  ∞ y(0)  =  5 (a) Find the Laplace transform of the right hand side of the above differential equation. (b) Let y(t) denote the solution to the above differential equation, and let Y((s) denote the Laplace transform of y(t). Find Y(s). (c) By taking the inverse Laplace transform of your answer to (b), the...
Consider the initial value problem: y' - (7/2)y = 7t + 2e^t Initial condition: y(0) =...
Consider the initial value problem: y' - (7/2)y = 7t + 2e^t Initial condition: y(0) = y0 a) Find the value of y0 that separates solutions that grow positively as t → ∞ from those that grow negatively. (A computer algebra system is recommended. Round your answer to three decimal places.) b) How does the solution that corresponds to this critical value of y0 behave as t → ∞? Will the corresponding solution increase without bound, decrease without bound, converge...
Problem 9-05 (Algorithmic) Kilgore’s Deli is a small delicatessen located near a major university. Kilgore’s does...
Problem 9-05 (Algorithmic) Kilgore’s Deli is a small delicatessen located near a major university. Kilgore’s does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.4, on one serving of Dial 911, $0.53. Each serving of Wimpy requires 0.2...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT