Rank-Based Solution Methods and their Applications in Determination of Non-Dominated Points Set For A Multi-Objective Integer Programming Model
Ali Al-Hasani, Masar Al-Rabeeah, Santosh Kumar and 1 more
International Journal of Mathematical, Engineering and Management Sciences · 2020
doi:10.33889/ijmems.2020.5.6.093 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
For any single-objective mathematical programming model, rank-based optimal solutions are computationally difficult to find compared to an optimal solution to the same single-objective mathematical programming model. In this paper, several methods have been presented to find these rank-based optimal solutions and based on them a new rank-based solution method (RBSM) is outlined to identify non-dominated points set of a multi-objective integer programming model. Each method is illustrated by a numerical example, and for each approach, we have discussed its limitations, advantages and computational complexity.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.