A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints

Access this Article

Abstract

The purpose of the paper is to consider a necessary and sufficient constraintqualification for local optimality conditions in DC programming problems withconvex inequality constraints. Also, we consider necessary and sufficient constraintqualifications for local optimality conditions in fractional programming problems andweakly convex programming problems.

Journal

  • Scientiae Mathematicae Japonicae

    Scientiae Mathematicae Japonicae 74(1), 49-54, 2011

    International Society for Mathematical Sciences

Codes

Page Top