1973
DOI: 10.1007/bf01580111
|View full text |Cite
|
Sign up to set email alerts
|

A revised simplex method for linear multiple objective programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
84
0
3

Year Published

1979
1979
2018
2018

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 229 publications
(87 citation statements)
references
References 4 publications
0
84
0
3
Order By: Relevance
“…We will later uae MCLP to define connectednese in discrete multiple criteria optimization. Before the general result of Theorem 1 was known the connectedness result for MCLP had been proved by varioua authora [2,4,12]. The most important solutions in linear programming are basic solutions which correspond to vertices of the polyhedral feasible set X, and fundamental solutions which correspond to extreme rays of X, if X is unbounded.…”
mentioning
confidence: 99%
“…We will later uae MCLP to define connectednese in discrete multiple criteria optimization. Before the general result of Theorem 1 was known the connectedness result for MCLP had been proved by varioua authora [2,4,12]. The most important solutions in linear programming are basic solutions which correspond to vertices of the polyhedral feasible set X, and fundamental solutions which correspond to extreme rays of X, if X is unbounded.…”
mentioning
confidence: 99%
“…15 (iii) Methods that generate efficient solutions and incorporate preferences a posteriori. Geoffrion (1968), 16 Evans and Steuer, 17 Zeleny, 18 Ecker et al 19 and Armand and Malivert, 20 among others, undertook the problem of finding the efficient set in MOLP.…”
Section: Classification Of Methods For Solving Molp Problemsmentioning
confidence: 99%
“…(The theory and a number of computer programs for multiobjective linear problems are widely discussed in the literature, e.g. by Evans and Steuer (1973) and Zeleny (1974).) In contrast, nonlinear problem formulations do not add to our understanding of reality and often cannot be solved by standard computerized solution techniques.…”
Section: The Basic Model and Difierent Versionsmentioning
confidence: 99%