Tilt-Stability And Sensitivity Of Polyhedric Programming In Finite-Dimensional Spaces

First, when K is polyhedric, we have the following assertions are equivalent:(1) Polyhedric programming problem is tilt-stable;(2) Subdifferential mapping is strong metrically regular;(3) Second-order sufficient condition holds uniformly for polyhedric programming.Finally, the paper investigate parametric problem of polyhedric programming in finite-dimensional spaces. We get regular coderivative of solutions maps in poly-hedric programming by regular coderivative of the normal cone of the polyhedric. Furthermore,necessary optimality conditions for MPEC in polyhedric programming is obtained.