In: Operations Management
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) | |||||||||
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