Multi-objective Programming Problem consists of conflicting objective functions, therefore, it is not necessary that optimum solution for one objective is also optimum for other objectives. In such situation, we need to find out a solution which is optimum for all the objectives in some sense i.e. compromise solution. In this paper, Value function and Chebyshev Goal Programming approaches are suggested to derive the optimum solution of Multi-objective Linear plus Linear Fractional Programming Problem (MOLPLFPP). Illustrative numerical examples are presented for demonstration purpose and the obtained solutions are compared with some existing solutions.
Sadia, Sheema; Gupta, Neha; Mazhar Ali, Qazi; and Bari, Abdul
"Solving Multi-Objective Linear plus Linear Fractional Programming Problem,"
Journal of Statistics Applications & Probability: Vol. 4:
2, Article 8.
Available at: https://digitalcommons.aaru.edu.jo/jsap/vol4/iss2/8