Min Z = 60x1 + 50x2 the constraints are : 5x1 + 3x2 ≥ 60 (Benefit...

Min Z = 60x1 + 50x2
the constraints are :
5x1 + 3x2 ≥ 60 (Benefit 1)
2x1 + 2x2 ≥ 30 (Benefit 2)
7x1 + 9x2 ≥ 126 (Benefiy 3)
x1 ≥ 0, x2 ≥ 0 non negative

from that linear modelling how to construct dual model and find reducing cost ? can anyone help .

Expert Solution

<<....End....>>

ekkarill92 answered 2 years ago

Min 8X1+3X2 S.T. 50X1 + 100X2 ≤ 1200 5X1 + 4X2 ≥ 60 X2 ≥ 3...

Min 8X1+3X2 S.T. 50X1 + 100X2 ≤ 1200 5X1 + 4X2 ≥ 60 X2 ≥ 3 X1,X2 ≥0 Using two-phase simplex method to solve it.

Solve this problem with the revised simplex method: Maximize Z = 5X1 + 3X2 + 2X3...

Solve this problem with the revised simplex method: Maximize Z = 5X1 + 3X2 + 2X3 Subject to 4X1 + 5X2 + 2X3 + X4 ≤ 20 3X1 + 4X2 - X3 + X4 ≤ 30 X1, X2, X3, X4 ≥ 0

Consider the following linear program. Maximize z= 5x1+ 3x2 subject to 3x1+ 5x2≤15 5x1+ 2x2≤10 –...

Consider the following linear program. Maximize z= 5x1+ 3x2 subject to 3x1+ 5x2≤15 5x1+ 2x2≤10 – x1+ x2≤2 x2≤2.5 x1≥0, x2≥0 a. Show the equality form of the model. b. Sketch the graph of the feasible region and identify the extreme point solutions. From this representation find the optimal solution. c. Analytically determine all solutions that derive from the intersection of two constraints or nonnegativity restrictions. Identify whether or not these solutions are feasible, and indicate the corresponding objective function...

MAX Z = 2x1 + 8x2 + 4x3 + 9x4 subject to 2x1 + 3x2 +...

MAX Z = 2x1 + 8x2 + 4x3 + 9x4 subject to 2x1 + 3x2 + 2x4 <= 8 2x2 + 5x3 + x4 <= 12 3x1 + x2 + 4x3 + 2x4 <= 15 and x1,x2,x3,x4 >= 0 apply the Primal Simplex Method to recover optimality.

1. Solve the following integer optimization model by using Excel Solver: Maximize Z = 5x1 +...

1. Solve the following integer optimization model by using Excel Solver: Maximize Z = 5x1 + 6x2 Subject to 3x1 + 4x2 < 10 4x1 + 2x2 < 15 x1, x2 > 0 and integer Please show how to use the excel solver as well as steps. :)

Consider the following linear programming problem: Max Z = 3x1 + 3x2 Subject to: ...

Consider the following linear programming problem: Max Z = 3x1 + 3x2 Subject to: 10x1 + 4x2 ≤ 60 25x1 + 50x2 ≤ 200 x1, x2 ≥ 0 Find the optimal profit and the values of x1 and x2 at the optimal solution.

Max Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2...

Max Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2 + 5x3 ≤ 12 3x1 + x2 + 4x3 ≤15 and x1,x2,x3≥0; Indicate clearly the optimal basic and nonbasic variables and their values and write the reduced cost of each optimal nonbasic variable.

MAX Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 <= 8 2x2...

MAX Z = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 <= 8 2x2 + 5x3 <= 12 3x1 + x2 + 4x3 <= 15 x1 + x3 = 11 and x1,x2,x3 >= 0 apply the Dual Simplex Method to recover feasibility.

"Primal" MAXIMIZE Z = 12X1 + 18X2 +10X3 S.T. 2X1 + 3X2 + 4X3 <= 50...

"Primal" MAXIMIZE Z = 12X1 + 18X2 +10X3 S.T. 2X1 + 3X2 + 4X3 <= 50 -X1 + X2 + X3 <= 0 0X1 - X2 + 1.5X3 <= 0 X1, X2, X3 >=0 1. Write the "Dual" of this problem. 2. Write the "Dual of the Dual" of this problem. For steps 3 & 4, use the Generic Linear Programming spreadsheet or the software of your choice. (Submit a file pdf, text, xls file, etc., indicating the solution values...

Question: 1- A database has four transactions. Let min sup = 60% and min conf =...

Question: 1- A database has four transactions. Let min sup = 60% and min conf = 80%. CID TID Items Bought 0... 1- A database has four transactions. Let min sup = 60% and min conf = 80%. CID TID Items Bought 01 T100 {King’s-Crab, Sunset-Milk, Dairyland-Cheese, Best-Bread } 02 T200 {Best-Cheese, Dairyland-Milk, Goldenfarm-Apple, Tasty-Pie, Wonder-Bread} 01 T300 {Westcoast-Apple, Dairyland-Milk, Wonder-Bread, Tasty-Pie} 03 T400 {Wonder-Bread, Sunset-Milk, Dairyland-Cheese} (a) At the granularity of item category (e.g., itemi could be “Milk”), for...

Question