Rank-Based Solution Methods and their Applications in Determination of Non-Dominated Points Set For A Multi-Objective Integer Programming Model
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...
Main Authors: | Ali Al-Hasani, Masar Al-Rabeeah, Santosh Kumar, Andrew Eberhard |
---|---|
Format: | Article |
Language: | English |
Published: |
International Journal of Mathematical, Engineering and Management Sciences
2020-12-01
|
Series: | International Journal of Mathematical, Engineering and Management Sciences |
Subjects: | |
Online Access: | https://www.ijmems.in/volumes/volume5/number6/93-IJMEMS-20-32-5-6-1249-1269-2020.pdf |
Similar Items
-
An Insight into the Characteristic Equation for an Integer Program
by: Santosh Kumar, et al.
Published: (2021-04-01) -
An Improved CPU Time in Triangle Splitting Method for Solving a Biobjective Mixed Integer Program
by: Ali Al-Hasani, et al.
Published: (2018-12-01) -
Pareto Dominance-Based Algorithms With Ranking Methods for Many-Objective Optimization
by: Vikas Palakonda, et al.
Published: (2017-01-01) -
Mixed-Integer Programming Model for Ranking Universities: Letting Universities Choose the Weights
by: Jakub Kudela
Published: (2021-06-01) -
The Weighted Aggregation of Ranked Objects by the Arbitrary Totality of Other Objects
by: Moskovkin Vladimir M., et al.
Published: (2018-08-01)