Question

Maximize Profit = 50x + 65y subject to: 3.5x + 4 y <= 84 1x +...

Maximize Profit = 50x + 65y

subject to:

3.5x + 4 y <= 84

1x + 1.5y <= 21

1x - 2y >= 0

x >= 0

y >= 0

Select the optimal number for "x".

Select one:

a. 5.25

b. 10.5

c. 945

d. 9.45

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

this is the right answer using Big M method. and correct answer does not match in your provided options.

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
a) Find the values of x and y in order to maximize the value of Q....
a) Find the values of x and y in order to maximize the value of Q. 2x+y=10 3x^2y=Q b) Find the number of units you will have to produce if you want to maximize profit if the cost and price equations are given below. Then find the maximum profit made. (6 points) C(x)= 4x+10 R(x)= 50x-0.5x^2 Units Produced: ____________________ Maximum Profit: ____________________ (Please show all work possible)
geographically analyze the following problem. maximize profit = $4X+$6Y subject to X + 2Y <= 8...
geographically analyze the following problem. maximize profit = $4X+$6Y subject to X + 2Y <= 8 hours 6X + 4Y <= 24 hours a. what is the optimal solution? b. if the first constraint is altered to X + 3Y<=8 does the feasable solution change
Maximize x + 2y subject to the following constraints (using the simplex method) -x+ y <=...
Maximize x + 2y subject to the following constraints (using the simplex method) -x+ y <= 100 6x + 6y <= 1200 x>=0, y>=0
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to:...
Consider the following linear programming model with 4 regular constraints: Maximize 3X + 5Y subject to: 4X + 4Y ≤ 48 (constraint #1) 2X + 3Y ≤ 50 (constraint #2) 1X + 2Y ≤ 20 (constraint #3) Y ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints) (a) Which of the constraints is redundant? Constraint #____. Justify using the data from the above LP model: ________________________________________________________________________ ________________________________________________________________________ ________________________________________________________________________ (b) Is solution point (10,5) a feasible solution? _____. Explain using...
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0...
Consider the following Linear Programming model: Maximize x+2.5y Subject to x+3y<=12 x+2y<=11 x-2y<=9 x-y>=0 x+5y<=15 x>=0 y>=0 (a) Draw the feasible region for the model, but DO NOT draw the objective function. Without graphing the objective function, find the optimal solution(s) and the optimal value. Justify your method and why the solution(s) you obtain is (are) optimal. (4 points) (b) Add the constraint “x+5y>=15” to the Linear Programming model. Is the optimal solution the same as the one in (a)?...
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...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤ 50 2x + 3y ≤ 120 x ≥ 10 x, y ≥ 0 (a) Graph the constraints and determine the feasible region. (b) Find the coordinates of each corner point of the feasible region. (c) Determine the optimal solution and optimal objective function value.
Question 1. Relate to the following maximization problem: maximize z(x,y)=10x^0.5y^0.5  subject to the constraint 10x+5y=40. A) What...
Question 1. Relate to the following maximization problem: maximize z(x,y)=10x^0.5y^0.5  subject to the constraint 10x+5y=40. A) What is the optimal value of x? B) What is the optimal value of y? C) What is the maximized value of z(x,y)?
LP Graphical Method Problems 1) MAXIMIZATION PROBLEM - 4 PTS Objective Function: Maximize Profit: 5X +...
LP Graphical Method Problems 1) MAXIMIZATION PROBLEM - 4 PTS Objective Function: Maximize Profit: 5X + 3Y Subject to the constraints: 5 X + 2 Y ≤ 40 3 X + 6 Y ≤ 48 X ≤ 7 2 X − Y ≥ 3 X , Y ≥ 0 ******* 2) MINIMIZATION PROBLEM - 4 PTS Objective function: Minimize Cost: 3X + 7Y Subject to the constraints: 9 X + 3 Y ≥ 36 4 X + 5 Y ≥...
Consider the following linear program: Max profit 8X + 4Y Subject to: 4X + 3Y ≤...
Consider the following linear program: Max profit 8X + 4Y Subject to: 4X + 3Y ≤ 480 2X + 3Y ≤ 360 X,Y ≥ 0 Use the corner point solution method to solve this linear program. The followings must be included in your answer: a) defined decision variables. b)a graph with constraints lines. c)highlighted feasible region. d)specified coordinates and profit for each corner point. e)specified optimal values of X and Y and optimal profit.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT