Acta mathematica scientia,Series A ›› 1999, Vol. 19 ›› Issue (2): 180-186.

• Articles • Previous Articles     Next Articles

A decomposition method for soling a class of bilevel convex programming

  

  1. (Wuhan University of Hydraulic and Electric Engineering, wuhan 430072)
  • Online:1999-05-01 Published:1999-05-01

Abstract:

The equivalence of a class of bilevel convex programming and the corresponding convex programming is researched. The duality and saddle-point of the convex programming is discussed.A decomposition method for solving the bilevel convex programming is grved.

Key words: StructurecoefficientofBanachspace, Weaklyconvergent, Uniformly, Lipschitzianmappings, Uniform Qpialcondition

CLC Number: 

  • 90C
Trendmd