Abstract
A Fritz John type sufficient optimality theorem is proved for nonlinear programming problems in finite dimensional complex space over polyhedral cones, which may include equality as well as inequality constraints.

This publication has 6 references indexed in Scilit: