Correlation Technique for Solving Multi -
Objective Programming (MOP) Problems - An
Evaluation

Chandra Sen

doi:https://doi.org/10.14445/22315373/IJMTT-V60P529

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 60 | Number 3 | Year 2018 | Article Id. IJMTT-V60P529 | DOI : https://doi.org/10.14445/22315373/IJMTT-V60P529

Correlation Technique for Solving Multi - Objective Programming (MOP) Problems - An Evaluation

Chandra Sen

Citation :

Chandra Sen, "Correlation Technique for Solving Multi - Objective Programming (MOP) Problems - An Evaluation," International Journal of Mathematics Trends and Technology (IJMTT), vol. 60, no. 3, pp. 187-190, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V60P529

Abstract

The paper evaluates the correlation technique for solving Multi-Objective Programming (MOP) problems. The correlation technique is proposed by Nawkhass and Birdawod[2] with its demonstration using examples. The technique becomes inefficient to solve the same problem with minor modification. The technique was also found unsuitable to solve other examples of MOP problems [1].

Keywords

Coefficient of correlation, Multi-Objective Programming, Weighted sum method.

References

[1] A.Nejmaddin, Suleiman, and M.A. Nawkhass, “Transforming and Solving Multi-objective Quadratic Fractional Programming Problems by Optimal Average of Maximin&Minimax Techniques,”. American Journal of Operational Research 3(3): 92-98, 2013.
[2] M.A.Nawkhassand Q.BHawkar, “Transformed and Solving Multi- Objective Linear Programming Problems to Single Objective by Using Correlation Technique,” Cihan International Journal of Social Science Vol. 1, No. 1 pp.0-36, 2017.