a) Write the dual of the following linear programming problem: Maximize Ζ = 3x1 + 5x2 + 4x3, Subject to 2x1 + 3x2 ≤ 8, 2x2 + 5x3 ≤10 3x1 + 2x2 + 4x3 ≤15 x1 , x2 , x3 ≥ 0 (b) Find the optimal solution to the given problem in (a) above, using the simplex method. (c) From the final optimal table in (b) above, find the solution to the dual problem.

a) Write the dual of the following linear programming problem: Maximize Ζ = 3x1 + 5x2 + 4x3, Subject to 2x1 + 3x2 ≤ 8, 2x2 + 5x3 ≤10 3x1 + 2x2 + 4x3 ≤15 x1 , x2 , x3 ≥ 0 (b) Find the optimal solution to the given problem in (a) above, using the simplex method. (c) From the final optimal table in (b) above, find the solution to the dual problem.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.3: Capital Budgeting Models

Problem 3P: Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows:...

See similar textbooks

Similar questions

Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows: 14, 58, 912, 1316, and 1720. a. Find the optimal investments when at most one investment from each group can be selected. b. Find the optimal investments when at least one investment from each group must be selected. (If the budget isnt large enough to permit this, increase the budget to a larger value.)
-For this problem clearly derive the Linear program-Graph this problem and clearly indicate the feasible options- Clearly determine the solution to the problem using the method of points (be smart about which points you have to evaluate based on the graph of the objective function
Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0
You are given the tableau shown in Table 74 for a maximization problem. Give conditions on the unknowns a1, a2, a3, b, and c that make the following statements true: a)The current solution is optimal. b)The current solution is optimal, and there are alternative optimal solutions. c)The LP is unbounded (in this part, assume that b 0).
b) Maximize Z = −40X1 −100X2s.t 10X1 + 5X2 ≤ 2502X1 + 5X2 ≤ 1002X1 + 3X2 ≤ 90X1, X2 ≥ 0Solve by simplex method, what are the solutions? Show that this problem hasmultiple solutions and find the solutions?
a) What is the optimal solution to this problem? Solve it graphically. b) If a technical breakthrough occurred that raised the profit per unit of X1 to $3, would this affect the optimal solution? c) Instead of an increase in the profit coefficient X1 to $3, suppose that profit was overestimated and should only have been $1.25. Does this change the optimal solution?
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 2), (0, 3), (2, 2), (2, 0), (1, 1), (2, 1), (3, 3)}. (a) Draw the directed graph of R. (b) Is R reflexive? Explain. (c) Is R symmetric? Explain. (d) Is R transitive? Explain
Given this linear programming model, solve the model and then answer the questions that follow.Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc.Subject toMachine 5x1 + 4x2 + 3x3 ≤ 160 minutes Labor 4x1 + 10x2 + 4x3 ≤ 288 hoursMaterials 2x1 + 2x2 + 4x3 ≤ 200 poundsProduct 2 x2 ≤ 16 units x1, x2, x3 ≥ 0 a. Are any constraints binding? If so, which one(s)?
4. Consider the following linear programming problem: Maximize Z=$15x + $5y, subject to (1) 2x + y ≤ 10 and (2) 4x + 3y ≤ 24 and (3) x, y ≥ 0. Will the optimal solution change if the objective function becomes Maximize Z=$15x + $20y (constraints remain the same)? Select one: a. Can't determine given the information. b. Yes, it will change. c. No, it remains the same.
(a) Write the optimization problem above as a linear program (b) Argue that the solution occurs at x ∗ = 1/2 (b1 + bm), the midrange of the data points
Find the indicated maximum or minimum value of the objective function in the linear programming problem. Minimize g = 10x + 6y subject to the following. x + 2y ≥ 10 2x + y ≥ 11 x + y ≥ 9 x ≥ 0, y ≥ 0
Consider the following LP model in standard form, with a row for the objective function Z. a) Put it into Canonical form ( or Simplex Tableau form) with basic variables X1, X2 , and X3. b) Determine the association BFS (Basic Feasible Solution) and the new formula for the objective function Z Minimize 10X1 + 4X2 Sujbject to 3X1 + 2X2 - X3 = 60 7X1 + 2X2 - X4 = 84 3X1 + 6X2 -X5 = 72 X1, X2, X3 , X4 , X5 >= 0