An Affine Scaling Algorithm for Biobjective Linear Programming

Given a biobjective linear programming problem, we develop an affine scaling algorithm with min-max direction and demonstrate its convergence for an efficient solution. We implement the algorithm for some minor issues in the literature.

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Operations Research Society of China (Internet) Ročník 12; číslo 4; s. 937 - 951
Hlavní autoři: Menezes, Marco Antonio Figueiredo, Maculan, Nelson
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer Nature B.V 01.12.2024
Témata:
Algorithms
Convergence
Decision making models
Hypotheses
Linear programming
Mathematical models
Optimization
Pareto optimum
Utility functions
ISSN:2194-668X, 2194-6698
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given a biobjective linear programming problem, we develop an affine scaling algorithm with min-max direction and demonstrate its convergence for an efficient solution. We implement the algorithm for some minor issues in the literature.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2194-668X
2194-6698
DOI:10.1007/s40305-023-00486-0