A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
Author:
- Dinh The LucDLDinh The Luc
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 13 (1) , 168-178
Abstract
In this note we present a new multiplier rule for a constrained multiobjective programming problem with continuous data by using the concept of unbounded approximate Jacobians recently developed by Jeyakumar and Luc [SIAM J. Control Optim., 36 (1998), pp. 1815--1832].Keywords
This publication has 14 references indexed in Scilit:
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality ConstraintsSIAM Journal on Optimization, 2000
- Nonsmooth Calculus, Minimality, and Monotonicity of ConvexificatorsJournal of Optimization Theory and Applications, 1999
- Optimality conditions for set-valued optimization problemsMathematical Methods of Operations Research, 1998
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-OptimizationSIAM Journal on Control and Optimization, 1998
- Generalized Differential Calculus for Nonsmooth and Set-Valued MappingsJournal of Mathematical Analysis and Applications, 1994
- Invex optimisation problemsBulletin of the Australian Mathematical Society, 1992
- Contingent derivatives of set-valued maps and applications to vector optimizationMathematical Programming, 1991
- Nonsmooth multiobjective programmingNumerical Functional Analysis and Optimization, 1989
- Fat homeomorphisms and unbounded derivate containersJournal of Mathematical Analysis and Applications, 1981
- Nonsmooth analysis: differential calculus of nondifferentiable mappingsTransactions of the American Mathematical Society, 1981