Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T13:05:41.843Z Has data issue: false hasContentIssue false

On converse duality in complex nonlinear programming

Published online by Cambridge University Press:  17 April 2009

J. Parida
Affiliation:
Department of Mathematics, Regional Engineering College, Rourkela, Orissa, India.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this note a converse duality theorem is proved for a class of nonlinear programming problems over polyhedral cones in finite dimensional complex space by a direct use of a Kuhn-Tucker type necessary and sufficient condition for constrained optimization in complex space.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1975