Characteristics of semi-convex frontier optimization

摘要: We study semi-convex frontier (SCF) optimization problems where objective functions can be and constraint sets non-polyhedron, which stem from a growing range of applications such as analysis, multi-objective programming in economics. The new findings this paper summarized follows: (1) characterize non-dominated points non-polyhedron optimal solution set program. (2) obtain optimality conditions constant modulus SCF program, the function is with semiconvexity modulus. (3) non-smooth Holder stability solutions semiconvex (4) use generalized differentiability to establish sensitivity analysis value