Question

Minimize Cost:  3a + 7b Subject to the following constraints: 4 Determine the optimal solution for this...

Minimize Cost:  3a + 7b

Subject to the following constraints:

4

Determine the optimal solution for this problem

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
Find the optimal solution for the following problem. (Round your answers to 3 decimal places.) Minimize...
Find the optimal solution for the following problem. (Round your answers to 3 decimal places.) Minimize C = 6x + 10y subject to 5x + 7y ≥ 14 8x + 6y ≥ 16 and x ≥ 0, y ≥ 0. What is the optimal value of x? What is the optimal value of y?
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)?
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on the feasible region described by the...
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1...
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1 + 2X2 > (or equal to) 80 3X1 + X2 > (or equal to) 75 X1, X2 > 0
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.
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...
Objective function P=70x+40y is subject to the following constraints: 4x+3y ≤ 26 x+2y ≤ 10 3≤...
Objective function P=70x+40y is subject to the following constraints: 4x+3y ≤ 26 x+2y ≤ 10 3≤ x ≤6 y≥2 x≥0 and y≥0 Optimal point is (5,2) and the maximum profit is $430 Question:Find the constraints that are binding and the ones that are redundant(i.e., is not needed to delineate the feasibility region)(please show your solution)
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
               For the following linear programming problem, determine the optimal solution by the...
               For the following linear programming problem, determine the optimal solution by the graphical solution method                                                                                              Max   -x + 2y                                                                                                          s.t.   6x - 2y <= 3          ...
How is Optimal Capitol Structure used to  minimize the cost of capitol?
How is Optimal Capitol Structure used to  minimize the cost of capitol?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT