Question

In: Operations Management

Solve the following linear programming problem by solver. Maximize Z = 7 x1 + 5 x2...

Solve the following linear programming problem by solver.
Maximize Z = 7 x1 + 5 x2 + 5 x3
subject to
x1 + x2 + x3 <= 25
2 x1 + x2 + x3 <= 40
x1 + x2          <= 25
                   x3 <= 6
x1, x2, x3 >= 0 (non-negativity conditions)

Solutions

Expert Solution

I have added the screenshot of the problem solved using solver in Excel

If you dont have solver add-in in excel please goto File->Options->Add-ins->Go->Click Solver Add-In->OK

Then follow the procedure of solver You can get ample videos on Youtube how to solve using solver

You can Refer Operations Research By H Taha where you will get to know how to solve it using Excel

As you can see i have addedthe coefficients of objective i below x1 x2 and x3 coloumn

Then in coinstraints also do the same

Now again below write x1, x2 and x3 column and leave it blank as that value has to be determined and also add A total column i.e. your objective value and that will be sum product of objective coefficients of x1,x2,x3 and the blank cells i.e our decission variables we are going to determine this cell will be given as objective cell to solve as you can see from the pic

For giving cinstraints do similar task i.e. sumproduct of blank x1,x2 and x3 with coefficients of constraint equation corresponding to column I in my case

do for all the other and add it to solver window to solve You will get the answer

Its a simple question i am sure you can solve it easily by taking my reference and reading the book


Related Solutions

consider the linear programming problem maximize z = x1 +x2 subjected tp x1 + 3x2 >=...
consider the linear programming problem maximize z = x1 +x2 subjected tp x1 + 3x2 >= 15 2x1 + x2 >= 10 x1 + 2x2 <=40 3x1 + x2 <= 60 x1 >= 0, x2>= 0 solve using the revised simplex method and comment on any special charateristics of the optimal soultion. sketch the feasible region for the problem as stated above and show on the figure the solutions at the various iterations
Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 +...
Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 + 200 x 2 Subject to : X1 + 8X2 <= 24 X1 + 2X2 <= 12 X1 >= 0 , X2 >= 0 You will need to graph each of the constraints to answer the following questions. You can draw a rough graph. a) State the coordinates of the point where the constraints interact. b) Define in words the region of feasible solutions. c)...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1...
Consider the following linear programming problem Maximize $1 X1 + $2 X2 Subject To 2 X1 + X2 ≤ 8 Constraint A X1 + X2 ≤ 5 Constraint B X1, X2 ≥ 0 Constraint C Note: Report two digits after the decimal point. Do NOT use thousands-separators (,) 1 - Which of the following is the correct standard maximization form for the above linear programming problem AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct AnswerCorrectNot Correct Z -X1 - 2 X2 =...
A linear programming problem has been formulated as follows: Maximize 10 X1 + 20 X2 X1...
A linear programming problem has been formulated as follows: Maximize 10 X1 + 20 X2 X1 + 2 X2 ≤ 100 2 X1 + X2 ≤ 100 2 X1 + 2 X2 ≥ 100 X1 ≥ 0, X2 ≥ 0 Which of the following represents the maximum value of the OF to this problem? Select one: a. 1350 b. 800 c. 950 d. 1200 e. 1000
Consider the following linear programming problem. min −x1 + 4x2 subject to: • x1 + x2...
Consider the following linear programming problem. min −x1 + 4x2 subject to: • x1 + x2 ≥ 1 • 3x1 + x2 ≤ .5 • x1, x2 ≥ 0 Formulate the dual of this problem.
Consider the problem   maximize   Z = 5 x1 + 3 x2 + 2 x3 + 4...
Consider the problem   maximize   Z = 5 x1 + 3 x2 + 2 x3 + 4 x4        subject to                       5 x1 + x2 + x3 + 8 x4 = 10                       2 x1 + 4 x2 + 3 x3 + 2 x4 = 10                                     X j > 0, j=1,2,3,4 (a) Make the necessary row reductions to have the tableau ready for iteration 0. On this tableau identify the corresponding initial (artificial) basic feasible solution. Also, identify the initial entering and...
Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 +...
Use the simplex method to solve the linear programming problem. Maximize objective function: Z= 6x1 + 2x2 Subject to constraints: 3x1 + 2x2 <=9 x1 + 3x2 <= 5 when x1, x2 >=0
Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to...
Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to X1 + X2 < 7 // Resource 1 –X1 + 3X2 < 3 // Resource 2 X1, X2 > 0 X1, X2 are integer i. Consider using the Branch and Bound (B & B) technique to solve the ILP model. With the help of Tora software, draw the B & B tree. Always give priority for X1 in branching over X2. Clearly label the...
Solve the following linear programs graphically. Minimize            Z = 4X1 - X2 Subject to            X1 +...
Solve the following linear programs graphically. Minimize            Z = 4X1 - X2 Subject to            X1 + X2 ≤ 6                             X1 - X2 ≥ 3                            -X1 + 2X2 ≥ 2                            X1, X2 ≥ 0
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT