On strong pseudoconvexity in nonlinear programming duality

On strong pseudoconvexity in nonlinear programming duality

0.00 Avg rating0 Votes
Article ID: iaor1990716
Country: India
Volume: 27
Issue: 2
Start Page Number: 1
End Page Number: 7
Publication Date: Jun 1990
Journal: OPSEARCH
Authors:
Abstract:

A strong pseudoconvexity assumption is applied to the constraints of the nonlinear programming problem to lead to a new duality theorem for the Mond-Weir dual. The result is extended to fractional programming problems.

Reviews

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