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 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.
Year of publication: |
1985
|
---|---|
Authors: | Benson, Harold P. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 31.1985, 4, p. 461-474
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | programming: multicriteria |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Note---Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
Benson, Harold P., (1985)
- More ...
Similar items by person
-
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
Benson, Harold P., (2009)
-
Benson, Harold P., (2002)
-
Benson, Harold P., (2000)
- More ...