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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of the Operational Research Society Jg. 44; H. 12; S. 1201 - 1209
Hauptverfasser: Vassilev, Vassil, Narula, Subhash C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 01.12.1993
Macmillan Press
Palgrave Macmillan UK
Palgrave
Pergamon Press
Taylor & Francis Ltd
Schlagworte:
Algorithms
Applied sciences
Business and Management
Exact sciences and technology
Integer programming
Integers
Iterative solutions
Linear programming
Management
Mathematical models
Mathematical programming
Mathematical vectors
Mathematics
Multiple Criteria
Multiple Objective Integer Programming
Objective functions
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Reference Points
Theoretical Paper
Theoretical Papers
Multiple Criteria
Reference Points
Multiple Objective Integer Programming
Integer programming
Linear programming
Multicriteria analysis
Algorithm
Interaction
Multiobjective programming
ISSN:0160-5682, 1476-9360
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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