An algorithm to solve multi-objective integer quadratic programming problem

The multi-objective integer programming problem often occurs in multi-criteria decision-making situations, where the decision variables are integers. In the present paper, we have discussed an algorithm for finding all efficient solutions of a multi-objective integer quadratic programming problem. T...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Annals of operations research Ročník 332; číslo 1-3; s. 433 - 459
Hlavní autori: Kushwah, Prerna, Sharma, Vikas
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.01.2024
Springer
Springer Nature B.V
Predmet:
Algorithms
Analysis
Business and Management
Combinatorics
Integer programming
Linear programming
Multiple criteria decision making
Multiple criterion
Multiple objective analysis
Operations Research/Decision Theory
Original Research
Quadratic programming
Theory of Computation
India
90C20
90C10
Efficient set
Quadratic programming problem
Multiple objective programming problem
90C29
Integer programming problem
ISSN:0254-5330, 1572-9338
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The multi-objective integer programming problem often occurs in multi-criteria decision-making situations, where the decision variables are integers. In the present paper, we have discussed an algorithm for finding all efficient solutions of a multi-objective integer quadratic programming problem. The proposed algorithm is based on the aspect that efficient solutions of a multi-objective integer quadratic programming problem can be obtained by enumerating ranked solutions of an integer quadratic programming problem. For determining ranked solutions of an integer quadratic programming problem, we have constructed a related integer linear programming problem and from ranked solutions of this integer linear programming problem, ranked solutions of the original integer quadratic programming problem are generated. Theoretically, we have shown that the developed method generates the set of all efficient solutions in a finite number of steps, and numerically we have elaborated the working of our algorithm and compared our results with existing algorithms. Further, we have analyzed that the developed method is efficient for solving a multi-objective integer quadratic programming problem with a large number of constraints, variables and objectives.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-022-05123-2