Title of article
Application of the penalty function method to generalized convex programs Original Research Article
Author/Authors
Chandal Nahak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
479
To page
483
Abstract
We use the penalty function method to study duality in generalized convex (invex) programming. In particular, we will obtain a new derivation under which the generalized convex (invex) programs do not have duality gaps.
Keywords
Penalty function , Lagrangian , Primal–dual inequality , Invex function , Duality
Journal title
Applied Mathematics Letters
Serial Year
2007
Journal title
Applied Mathematics Letters
Record number
898388
Link To Document