Question

The two objective functions (Maximize 5x + 7y, and Minimize -5x - 7y) will produce the...

The two objective functions (Maximize 5x + 7y, and Minimize -5x - 7y) will produce the same solution to a linear programming problem. True/ False?

Homework Answers

Answer #1

Answer: FALSE

Explanation:

A maximization problem with the objective of, Maximize f(x) subject to x S is equivalent to the minimization problem with the objective function, Minimize -f(x) subject to x S.

Let f(x,y) = 5x + 7y

then

-f(x,y) = -(5x+7y) = -5x-7y

So, maximizing f(x,y) is same as minimizing -f(x,y).

But the solution to the maximization problem = -1 times the solution of the minimization problem.

Hence the solution is not exactly the same. The numbers might be the same but the signs change and hence the values.

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
Solve the linear programming problem by the method of corners. Maximize P = 5x + 7y...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 7y subject to 2x + y ≤ 16 2x + 3y ≤ 24 y ≤  7 x ≥ 0, y ≥ 0 The maximum is P = at (x, y) = .
1.For the following linear programming problem Max 5X + 7Y s.t. 1X+ 1Y≤ 6 3X +1Y...
1.For the following linear programming problem Max 5X + 7Y s.t. 1X+ 1Y≤ 6 3X +1Y ≤ 12 X+ 2Y ≤ 10 X, Y ≥ 0 a)Write the problem in standard form. b)Solve the problem neatly using the graphical solution procedure(on paper). c)What are the values of the three slack variables at the optimal solution? d)Solve the problem with Microsoft Excel and attach your “own” printout.
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 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 linear programming problem by the simplex method. Maximize   P = 5x + 4y subject...
Solve the linear programming problem by the simplex method. Maximize   P = 5x + 4y subject to   3x + 5y ≤ 214 4x + y ≤ 172 x ≥ 0, y ≥ 0    The maximum is P = at (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 ≥...
In the graphical solution of a linear programming problem to minimize cost, we seek to move...
In the graphical solution of a linear programming problem to minimize cost, we seek to move the example line for the objective function Away from the origin Toward the origin Parallel to the X1 axis Parallel to the X2 axis None of the above
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.
Use the method of this section to solve the linear programming problem. Minimize   C = x...
Use the method of this section to solve the linear programming problem. Minimize   C = x + 2y subject to   4x + 7y ≤ 60 2x + y = 28 x ≥ 0, y ≥ 0    The minimum is C =   at (x, y) =
14.       Use Excel to solve the following. A firm’s objective is to Maximize Profits and Minimize Costs....
14.       Use Excel to solve the following. A firm’s objective is to Maximize Profits and Minimize Costs. Demand is Q = 400 – 2*P, The firm’s production function is: Q = 5*L.6*K.5 Total Cost is: TC = PL*L + PK*K = $6*L + $12*K The objective is to maximize Profit: Profit = TR – TC. Find the Profit-Maximizing Price. A.        94.2                 B.        101.1               C.        111.4               D.        115.3               E.         121.4 15.       Refer back to the problem in question#14.  What is the cost minimizing ratio of marginal product to input price? A.        .30                   B.        .47                   C.        .56                   D.        .64       E.         .70