A multiplier rule for multiobjective programming problems with continuous data
https://doi.org/10.1137/S1052623400378286Publisher, magazine: ,
Publication year: 2002
Lưu Trích dẫn Chia sẻAbstract
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 \textit{V. Jeyakumar} and \textit{D. T. Luc} [SIAM J. Control Optim. 36, 1815–1832 (1998; Zbl 0923.49012)].
Tags: efficient solution; multiplier rule; approximate Jacobian; multiobjective programming
Các bài viết liên quan đến tác giả Đinh Thế Lục
An open mapping theorem using unbounded generalized Jacobians
A multiplier rule for multiobjective programming problems with continuous data
Recessively compact sets: properties and uses
Generating the weakly efficient set of nonconvex multiobjective problems
Chain rules for approximate Jacobians of continuous functions
Convex composite non-Lipschitz programming
Sharp variational conditions for convex composite nonsmooth functions
Equi-surjective systems of linear operators and applications
Pseudo-Jacobians and a necessary condition in dynamic optimization