1996
DOI: 10.1007/bf02275354
|View full text |Cite
|
Sign up to set email alerts
|

Solving multiple-objective problems in the objective space

Abstract: Abstract. Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

1998
1998
2016
2016

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…Let P (A f , B f ) be the set of Paretooptimal solutions of problem (5). This is the set of all matrices K * such that (6) and (7) hold true :…”
Section: B Recoverabilitymentioning
confidence: 99%
“…Let P (A f , B f ) be the set of Paretooptimal solutions of problem (5). This is the set of all matrices K * such that (6) and (7) hold true :…”
Section: B Recoverabilitymentioning
confidence: 99%
“…As displayed in Fig.4, the utility functions regarding two objectives can be defined by considering the physical significance of the relevant quantities [10]. Through the multi-linear utility elicitation [12,13], the utility function in this study can be defined as…”
Section: Optimal Architecturementioning
confidence: 99%
“…Applications and modifications of the GDF method are described in [4,40,42,51,53,73,79,84,143,144,164,186,197,203,219,264].…”
Section: Geoffrion-dyer-feinberg Methodsmentioning
confidence: 99%