On converse duality for nonsmooth optimization problem

On converse duality for nonsmooth optimization problem

0.00 Avg rating0 Votes
Article ID: iaor1994284
Country: India
Volume: 14
Issue: 2
Start Page Number: 149
End Page Number: 153
Publication Date: May 1993
Journal: Journal of Information & Optimization Sciences
Authors: ,
Keywords: programming: nonlinear
Abstract:

Recently, Reiland defined the nonsmooth invexity of Lipschitz functions and obtained the generalized Kuhn-Tucker sufficient optimality criteria, the weak duality and the strong duality for a nonlinear optimization problem (P) involving non-smooth invex Lipschitz functions. The purpose of this brief paper, following Jeyakumar’s approach, is to establish the converse duality for (P).

Reviews

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