Shen Jinxing
School of Computer Science, Guangdong Polytechnic Normal University, 510665, Guangzhou, China
ABSTRACT
The Characterizations of the solution set in extremely problem under inclusion constrains:(P):
is considered in this study. When f is continuously convex and F is a set-valued map with convex graph, the Lagrange function of (P) is proved to be a constant on the solution set and this property is then used to derive various simple Lagrange multiplier-based characterizations of the solution set of (P).
PDF References Citation
How to cite this article
Shen Jinxing, 2013. Characterizations of Optimal Solution Set in Programming Problem under Inclusion Constrains. Information Technology Journal, 12: 6247-6252.
DOI: 10.3923/itj.2013.6247.6252
URL: https://scialert.net/abstract/?doi=itj.2013.6247.6252
DOI: 10.3923/itj.2013.6247.6252
URL: https://scialert.net/abstract/?doi=itj.2013.6247.6252