Abstract
An optimality condition for the ordinary convex programming problem which utilizes the directional derivatives of the constraints is studied.

This publication has 4 references indexed in Scilit: