Generalized saddle points in multi-objective bilinear programming
From MaRDI portal
(Redirected from Publication:580190)
This not clearly written paper tries to link the theory of multiobjective linear programming to the theory of generalized saddle points as introduced by \textit{W. Rödder} [Eur. J. Oper. Res. 1, 55-59 (1977; Zbl 0383.90099)]. Lemma 1 is formulated ambiguously and therefore the proof of Lemma 2 does not seem to be correct. See also related work by \textit{F. Ferro} [Ann. Mat. Pura Appl., IV. Ser. 132, 113-130 (1982; Zbl 0508.49010)].
Recommendations
- Saddle point and generalized convex duality for multiobjective programming.
- scientific article; zbMATH DE number 36688
- Saddle points and Pareto points in multiple objective programming
- Saddle points and scalarizing sets in multiple objective linear programming
- scientific article; zbMATH DE number 1779897
Cited in
(4)- Constrained \(\epsilon\)-vector valued games and generalized multi-valued \(\epsilon\)-minmax, \(\epsilon\)-maxmin programming.
- scientific article; zbMATH DE number 1135789 (Why is no real title available?)
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- scientific article; zbMATH DE number 2159098 (Why is no real title available?)
This page was built for publication: Generalized saddle points in multi-objective bilinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580190)
