On harmonic convexity (concavity) and application to non-linear programming problems

On harmonic convexity (concavity) and application to non-linear programming problems

0.00 Avg rating0 Votes
Article ID: iaor20041786
Country: India
Volume: 40
Issue: 1
Start Page Number: 42
End Page Number: 51
Publication Date: Mar 2003
Journal: OPSEARCH
Authors: , ,
Keywords: duality
Abstract:

The concept of harmonic convexity (concavity) is used to derive duality in non-linear programming problems. Moreover, the concept is extended to duality in fractional programming, symmetric and self-dual programs under weaker convexity conditions.

Reviews

Required fields are marked *. Your email address will not be published.