A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems

In this paper, we propose a reference direction approach and an interactive algorithm to solve the general multiple objective integer linear programming problem. At each iteration, only one mixed integer linear programming problem is solved to find an (weak) efficient solution. Each intermediate sol...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of the Operational Research Society Ročník 44; číslo 12; s. 1201 - 1209
Hlavní autoři: Vassilev, Vassil, Narula, Subhash C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 01.12.1993
Macmillan Press
Palgrave Macmillan UK
Palgrave
Pergamon Press
Taylor & Francis Ltd
Témata:
ISSN:0160-5682, 1476-9360
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í:In this paper, we propose a reference direction approach and an interactive algorithm to solve the general multiple objective integer linear programming problem. At each iteration, only one mixed integer linear programming problem is solved to find an (weak) efficient solution. Each intermediate solution is integer. The decision maker has to provide only the reference point at each iteration. No special software is required to implement the proposed algorithm. The algorithm is illustrated with an example.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1993.199