Modified relaxation method for mathematical programs with complementarity constraints | Zendy

Lin GuiHua | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Modified relaxation method for mathematical programs with complementarity constraints

Author(s) -

Lin GuiHua

Publication year - 2007

Publication title -

mathematical methods in the applied sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.719

H-Index - 65

eISSN - 1099-1476

pISSN - 0170-4214

DOI - 10.1002/mma.881

Subject(s) - complementarity (molecular biology) , mathematics , mixed complementarity problem , relaxation (psychology) , complementarity theory , mathematical optimization , mathematical theory , calculus (dental) , mathematical economics , physics , quantum mechanics , medicine , psychology , social psychology , genetics , dentistry , nonlinear system , biology

In this paper, we suggest a new relaxation method for solving mathematical programs with complementarity constraints. This method can be regarded as a modification of a method proposed in a recent paper ( J. Opt. Theory Appl. 2003; 118 :81–116). We show that the main results remain true for the modified method and particularly, some conditions assumed in the previous paper can be removed. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research