• Nirma Narayan
• M.G.M. Khan

The solution of multi-objective optimization problem always has much attention to the decision makers in management science as the objectives typically conflict each other. In this article, we devise a simplex technique approach to solve multi-objective linear programming problem (MOLP), in which all objectives are optimized simultaneously. Illustrations of computational details of the proposed technique is indicated via numerical methods. A real-life situation of a food processing problem is discussed and applied to the proposed technique to demonstrate the formulation of a MOLP. A comparative study is explicated by emphasizing on the comparison of the proposed approach with the preemptive goal programming approach. The computed results clearly show the usefulness, practicality and strength of the proposed technique in optimizing MOLP with reduced computational effort as compared to other goal programming technique. The results of the proposed technique are efficient, convenient and shows that the algorithm is applicable to almost all MOLP.

Multi-objective linear programming, Goal programming, Simplex algorithm, multi-criteria optimization.

"MULTI-OBJECTIVE OPTIMIZATION USING SIMPLEX METHOD", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 3, page no.a701-a714, March-2024, Available :http://www.jetir.org/papers/JETIR2403096.pdf

"MULTI-OBJECTIVE OPTIMIZATION USING SIMPLEX METHOD", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 3, page no. ppa701-a714, March-2024, Available at : http://www.jetir.org/papers/JETIR2403096.pdf