<![CDATA[Linear programming is a Mathematical model that uses programming language technique tomodel and solve optimization problems with linear objective functions and constraints.A Mathematical model for optimization problems such as, linear programming with one objectivefunction can be written as:Objective Function: Minimum or Maximum f X1,X2 ,...,Xn Constraints: m n mk n knf X ,X ,...,X bf X ,X ,...,X bf X ,X ,...,X b1 21 21 1 2 1X1,X2 ,...,Xn 0However, in fact there are sometimes more than one objective functions that should be reached,either be maximized, minimized or both. This research aims to determine procedures in obtainingthe optimal solution of linear programming with n objective functions using Solver simplexmethod in a sample case.The method of this research is a literature study by collecting and studying references that arerelevant about linear programming models with n objective functions, Solver Parameters, andsimplex method. Then, determining procedures to obtain the optimal solution to the model ina sample case.The result shows that the procedures of obtaining optimal solution in a linear programmingmodel with n objective functions using Solver simplex method are: identifying and understandingthe problem; determining decision variables Xi, objective functions fi Xi, and constraintsgi Xi; formulating components in linear programming model into a spreadsheet MS Excel;solving the optimal value for each objective function with Solver Parameters; determining theoptimal value for i th objective function as the i th goal value; determining deviation function foreach objective function; giving weights wi for the deviation function of each objective function;determining the maximum value of feasible deviation function from its objective functions(variable Q); minimizing variable Q to obtain the optimal solution; and making decision.]]>
Copyrights © 2010
