A linearization approach to multiobjective programming duality (Q2367782): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jmaa.1993.1167 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091187916 / rank | |||
Normal rank |
Latest revision as of 21:28, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linearization approach to multiobjective programming duality |
scientific article |
Statements
A linearization approach to multiobjective programming duality (English)
0 references
15 August 1993
0 references
The authors consider duality of multiobjective problems having linear constraints and pseudo-convex objective functions. The dual is constructed by linearizing the various objective functions in the primal problem around an arbitrary but fixed point \(\bar x\) and formulating the dual of the multiobjective linear program so obtained. For deriving the results the authors show a closed relationship between the efficient solutions of the original problem and the efficient solutions of the linearized problem. Then by using Schönfeld's dual the results are obtained. Finally, an application of these results to multiobjective fractional programming problem with different denominators is discussed.
0 references
duality of multiobjective problems
0 references
linear constraints
0 references
pseudo-convex objective functions
0 references