We consider a nondifferentiable convex multiobjective optimization problem whose feasible set is defined by affine equality constraints, convex inequality constraints, and an abstract convex set constraint. We obtain Fritz John and Kuhn–Tucker necessary and sufficient conditions for ε-Pareto optimality via a max function. We also provide some relations among ε-Pareto solutions for such a problem and approximate solutions for several associated scalar problems.
ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
Log in via your institution
Log in to Taylor & Francis Online
Restore content access
Restore content access for purchases made as guestPDF download + Online access
- 48 hours access to article PDF & online version
- Article PDF can be downloaded
- Article PDF can be printed
Issue Purchase
- 30 days online access to complete issue
- Article PDFs can be downloaded
- Article PDFs can be printed
Related Research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.