Abstract
Duality and penalty methods are popular in optimization. The study on duality and penalty methods for nonconvex multiobjective optimization problems is very limited. In this paper, we introduce vector-valued nonlinear Lagrangian and penalty functions and formulate nonlinear Lagrangian dual problems and nonlinear penalty problems for multiobjective constrained optimization problems. We establish strong duality and exact penalization results. The strong duality is an inclusion between the set of infimum points of the original multiobjective constrained optimization problem and that of the nonlinear Lagrangian dual problem. Exact penalization is established via a generalized calmness-type condition.
Sign-in/Register to access full text options 
Free) 
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 call
