Optimization on multi-objective functions

In this thesis two Methods (weighting method, €-Constraint Method) are used for solving multi-objective Linear programming problem. These two methods are transform the multi-objective problem into single-objective programming form. A new proposition is constructed for solving multi-objective functions, This proposition dependent on transform the problerh from optimizing on multi-objective Linear programming into optimizing on single non-Linear objective functions. Also the behavior of solutions is investigated when the cost coefficients of objective functions are variation.