Abstract
In this paper, a new approach to a characterization of solvability of a nonlinear nonsmooth multiobjective programming problem with inequality constraints is introduced. A family of η -approximated vector optimization problems is constructed by a modification of the objective and the constraint functions in the original nonsmooth multiobjective programming problem. The connection between (weak) efficient points in the original nonsmooth multiobjective programming problem and its equivalent η -approximated vector optimization problems is established under V -invexity. It turns out that, in most cases, solvability of a nonlinear nonsmooth multiobjective programming problem can be characterized by solvability of differentiable vector optimization problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
