Using Harmonic Mean to Solve Multi-Objective Linear Programming Problems

Sulaiman, Nejmaddin A.; Mustafa, Rebaz

doi:10.4236/ajor.2016.61004

Cited by 17 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To solve multi-objective linear programming problems, various types of methods have been proposed by various scholars, such as Mean and median method by Sulaiman and Sadiq [17], Optimal transformation technique by Sulai-man and Ameen [4], Harmonic mean by Sulaiman and Mustafa [9], New statistical average method by Nahar and Alim [12].…”

Section: Introductionmentioning

confidence: 99%

Advanced Transformation Technique to Solve Multi-Objective Optimization Problems

Yesmin¹,

Alim²

2021

AJOR

View full text Add to dashboard Cite

Multi-objective optimization problem (MOOP) is an important class of optimization problem that ensures users to model a large variety of real world applications. In this paper an advanced transformation technique has been proposed to solve MOOP. An algorithm is suggested and the computer application of algorithm has been demonstrated by a flow chart. This method is comparatively easy to calculate. Applying on different types of examples, the result indicates that the proposed method gives better solution than other methods and it is less time consuming. Physical presentation and data analysis represent the worth of the method more compactly.

show abstract

Section: Introductionmentioning

confidence: 99%

Advanced Transformation Technique to Solve Multi-Objective Optimization Problems

Yesmin¹,

Alim²

2021

AJOR

View full text Add to dashboard Cite

show abstract

“…Sulaiman, N. A. and Mustafa, R. B. [5] proposed harmonic mean technique to solve multi-objective linear programming problems. Nahar, S. and Alim, M. A.…”

Section: Introductionmentioning

confidence: 99%

Modeling of Gauss Elimination Technique and AHA Simplex Algorithm for Multi-objective Linear Programming Problems

Jain

Mangal

2020

AJPAS

View full text Add to dashboard Cite

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.

show abstract

“…A lot of important works have been done such as, Abdul-Kadir and Sulaiman [1] proposed an approach for multi-objective fractional programming problem. Sulaiman and Mustafa [2] discussed harmonic mean to solve multi-objective linear programming problems. Nahar and Alim [3] generalized multi-objective linear fractional programming problem by a new geometric average method to get optimal solution.…”

Section: Introductionmentioning

confidence: 99%

Statistical Averaging Method and New Statistical Averaging Method for Solving Extreme Point Multi–Objective Linear Programming Problem

Nahar¹

2018

View full text Add to dashboard Cite

In this paper, statistical averaging method (arithmetic mean, geometric mean) and new statistical averaging method (new arithmetic mean, new geometric mean) have been proposed for extreme point multi-objective linear programming problem (EPMOLPP). Extreme point can be taken from graphical representation of linear programming problem (LPP). Graphical solution of LPP has been discussed in this research The objective of this method is for making single objective from multi-objective extreme point linear programming problem. Chandra Sen's method is for making single objective from multi-objective linear programming problem (MOLPP). Here Chandra Sen's method has also been used to solve EPMOLPP. An algorithm and program solution have been given for our proposed method to solve such type of problems. A numerical example is given and the result in Table 2 indicates that the proposed technique gives better results.

show abstract

Using Harmonic Mean to Solve Multi-Objective Linear Programming Problems

Cited by 17 publications

References 2 publications

Advanced Transformation Technique to Solve Multi-Objective Optimization Problems

Advanced Transformation Technique to Solve Multi-Objective Optimization Problems

Modeling of Gauss Elimination Technique and AHA Simplex Algorithm for Multi-objective Linear Programming Problems

Statistical Averaging Method and New Statistical Averaging Method for Solving Extreme Point Multi–Objective Linear Programming Problem

Contact Info

Product

Resources

About