Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1710477 | Applied Mathematics Letters | 2007 | 5 Pages |
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
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Chandal Nahak,