Duality theorem of nondifferentiable convex multiobjective programming
- 1 September 1986
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 50 (3) , 407-420
- https://doi.org/10.1007/bf00938628
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Duality in vector optimizationMathematical Programming, 1983
- Some minimax theorems in vector-valued functionsJournal of Optimization Theory and Applications, 1983
- Necessary conditions for optimality of nondifferentiable convex multiobjective programmingJournal of Optimization Theory and Applications, 1983
- Duality theorems and an optimality condition for non-differentiable convex programmingJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1982
- Weak Pareto optimality of multiobjective problems in a locally convex linear topological spaceJournal of Optimization Theory and Applications, 1981
- More on subgradient dualityJournal of Mathematical Analysis and Applications, 1979
- Duality theory in multiobjective programmingJournal of Optimization Theory and Applications, 1979
- A subgradient duality theoremJournal of Mathematical Analysis and Applications, 1977
- Pareto optimality in multiobjective problemsApplied Mathematics & Optimization, 1977
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961