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.

No abstract

In this paper a method is proposed to solve fractional programming problem in which the functional relationship between the decision variables and the objective function is not completely known. Here we established the crisp functional relationship between the objective function and the decision variables and solve the resulting programming problem to find a fair optimal solution to the original problem. An example is given in the last to illustrate the result.

No abstract

No abstract