A new approach to characterize the solution set of a pseudoconvex programming problem

作者：

Highlights：

•

摘要

A new approach to characterize the solution set of a nonconvex optimization problem via its dual problem is proposed. Some properties of the Lagrange function associated to the problem are investigated. Then characterizations of the solution set of the problem are established.

论文关键词：90C46,49N15,Mixed type duality,Lagrange function,Solution set

论文评审过程：Received 2 April 2012, Revised 8 April 2013, Available online 15 November 2013.

论文官网地址：https://doi.org/10.1016/j.cam.2013.11.004