Sublinear Lagrange Rules for Quasidifferentiable Programming
Song Chun-ling · Journal of Liaoning Normal University · 2006
Lagrange muliplier type optimality conditions for constrained quasidifferentiable programming usually depend on the choice of special objects(super-gradient,direction,and so on),which is one of the key problems for constrained quasidifferentiable programming.In this paper,applying Minkowski duality of convex compact sets and sublinear functions,the sublinear Lagrange multiplic rule for quasidifferentiable optimization with a finite number of inequality and equality constraints are deduced by the nonlinear Lagrange function generated by a sublinear function,which improves the existing results.