Abstract
An error in an algorithm, in Jahanshahloo et al. (Asia Pacific Journal of Operational Research 21(1):127–139, 2004), to generate efficient solutions to a 0-1 multi objective linear programming problems is detected and a modified algorithm is suggested. Further, an erroneous conclusion in the proof of the theorem, which states that at least one optimal solution among the optimal solutions of an individual 0-1 linear program is an efficient solution, is also corrected.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jahanshahloo, G.R., Lofti, F.H., et al.: A method for generating all the efficient solutions of a 0-1 multi-objective linear programming problem. Asia Pacific Journal of Operational Research 21(1), 127–139 (2004)
Liu, F.H.F., Huang, C.C., Yen, Y.L.: Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs. European Journal Of Operational Research 126, 51–68 (2000)
Parthsarathy, K.R.: Basic Graph Theory. Tata Mc Graw Hill (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dumaldar, M.N. On efficient solutions of 0-1 multi-objective linear programming problems. OPSEARCH 52, 861–869 (2015). https://doi.org/10.1007/s12597-015-0211-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12597-015-0211-z