Open AccessModeling of Gauss Elimination Technique and AHA Simplex Algorithm for Multi-objective Linear Programming Problems
Author(s) -
Sanjay Jain,
Adarsh Mangal
Publication year - 2020
Publication title -
asian journal of probability and statistics
Language(s) - English
Resource type - Journals
ISSN - 2582-0230
DOI - 10.9734/ajpas/2020/v8i430211
Subject(s) - linear programming , simplex algorithm , linear fractional programming , criss cross algorithm , gauss , mathematical optimization , algorithm , simplex , simple (philosophy) , revised simplex method , mathematics , set (abstract data type) , function (biology) , computer science , linear inequality , inequality , mathematical analysis , philosophy , physics , geometry , epistemology , quantum mechanics , evolutionary biology , biology , programming language
In this research paper, an effort has been made to solve each linear objective function involved in the Multi-objective Linear Programming Problem (MOLPP) under consideration by AHA simplex algorithm and then the MOLPP is converted into a single LPP by using various techniques and then the solution of LPP thus formed is recovered by Gauss elimination technique. MOLPP is concerned with the linear programming problems of maximizing or minimizing, the linear objective function having more than one objective along with subject to a set of constraints having linear inequalities in nature. Modeling of Gauss elimination technique of inequalities is derived for numerical solution of linear programming problem by using concept of bounds. The method is quite useful because the calculations involved are simple as compared to other existing methods and takes least time. The same has been illustrated by a numerical example for each technique discussed here.