BOUNDEDNESS OF OPTIMAL FUNCTION VALUE ON NON-CONIC CONVEX OPTIMIZATION PROBLEMS
Lin Jiao-yan · Journal of South China Normal University · 2009
In the case that the constraint is a general convex set and the primitive non-convex programming or its dual is feasible,the variation of the optimal objective function value for the new system is investigated when d is perturbated.