×

Optimality conditions and duality in optimization with generalized arcwise connectivity over convex cones. (Chinese. English summary) Zbl 1363.90274

Summary: In this paper optimality conditions on strong efficient solution and Benson proper efficient solution in optimization with arcwise connectivity over cones were given. We discussed the optimality conditions on approximate solution in optimization under which both object function and constraint function are generalized arcwise connectivity convex cones. An approximate Mond-Weir type dual problem was formulated, weak duality and converse duality theorems were established.

MSC:

90C46 Optimality conditions and duality in mathematical programming
90C25 Convex programming
PDFBibTeX XMLCite