A Duality Theorem in Multiobjective Nonlinear Programming

Published Online:https://doi.org/10.1287/moor.7.1.95

We give a duality theorem in multiobjective nonlinear programming problems by means of conjugate set-valued functions which were introduced in (Kawasaki, H. 1981. Conjugate relations and weak subdifferentials of relations. Math. Oper. Res.6 593–607.). The duality theorem is reflexive in the sense analogous to (Ekeland, I., R. Temam. 1976. Convex Analysis and Variational Problems. North-Holland, Amsterdam.).

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.