Question

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 (same constraints found in problem #3) 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 above constraints.

  1. Maximize Profit: Z = 5X + 7Y, where the coefficients are the unit profit per quantity X and Y produced.

Optimal solution:                                                                                                                                                            

               

Objective Function Value at the optimal solution:                                                                                             

  1. Maximize Profit:      Z = 3X + 2Y, where the coefficients are the unit profit per quantity X and Y produced.

Optimal solution:                                                                                                                                                            

               

Objective Function Value at the optimal solution:                                                                                             

Homework Answers

Answer #1

(a)

Feasible region is the shaded in the figure.

We draw objective function for an arbitrary value (350 here). Objective function is drawn with dotted lines.

We move the objective function parallel to the dotted one and observe that it attains maximum at A (40, 80).

Thus optimal solution is x=40, y=80.

Objective function value at the optimal solution is 5*40+7*80 = 760.

(b)

Feasible region is the shaded in the figure.

We draw objective function for an arbitrary value (120 here). Objective function is drawn with dotted lines.

We move the objective function parallel to the dotted one and observe that it attains maximum at B (100, 20).

Thus optimal solution is x=100, y=20.

Objective function value at the optimal solution is 3*100+2*20 = 340.

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 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...
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.
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...
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)?...
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: 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
If a problem is referred to as a linear programming problem, what must be true? A)...
If a problem is referred to as a linear programming problem, what must be true? A) the objective function must be linear B) both the objective function and the constraints must be linear C) the constraints must be linear D) the decision variables must be linear Three essential elements of a linear programming formulation are the: A) decision variables, feasibility, constraints B) constraints, objective function, non-negativity C) decision variables, objective function, constraints D) objective function, constraints, solution When constraints identify...
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.
I'm trying to graph four constraints to get a feasible region for a linear optimization model....
I'm trying to graph four constraints to get a feasible region for a linear optimization model. I've determined that my constraints are: x + y = 1,000 x >= 250 y >= 250 x >= 2y I think the values of the constraints in my problem are: 1000 = 1000 667 >= 250 333 >= 250 667 >= 666 Using those, how do I graph those values in my scatterplot to get the feasible region?!?! Here's the question I'm working...
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)