Multiple Objective Linear Programming with Parametric Criteria Coefficients

In this paper we study the multiple objective linear programming problem with parametric criteria coefficients. This problem is of interest since in many situations the coefficients of the objective functions of a multiple objective linear program either represent estimates of the true data or are s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science Jg. 31; H. 4; S. 461 - 474
1. Verfasser: Benson, Harold P
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Linthicum, MD INFORMS 01.04.1985
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Schriftenreihe:Management Science
Schlagworte:
Algorithms
Applied sciences
Candidates
Capital budgeting
Criteria
Decomposition methods
Estimates
Exact sciences and technology
Goal programming
Linear programming
Management science
Mathematical models
Mathematical programming
Mathematische Optimierung
Matrices
Multiple criteria decision making
Objective functions
Objectives
Operational research and scientific management
Operational research. Management science
Optimal solutions
Planning
programming: multicriteria
Public sector
Tableaux
Uncertainty
Water resources
Zero
Linear programming
Multicriteria analysis
Multiobjective programming
Parametric programming
Mathematical programming
ISSN:0025-1909, 1526-5501
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we study the multiple objective linear programming problem with parametric criteria coefficients. This problem is of interest since in many situations the coefficients of the objective functions of a multiple objective linear program either represent estimates of the true data or are subject to systematic variations. Properties of this problem are developed, and an algorithm for generating the set of all weakly-efficient extreme points of this problem is described. To implement this algorithm, a nonconvex subproblem must be solved for each candidate extreme point encountered. This is accomplished by applying the Generalized Benders Decomposition method. Computational results concerning the solution of these subproblems are presented.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.31.4.461