Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T03:20:56.586Z Has data issue: false hasContentIssue false

Duality for generalized problems in complex programming

Published online by Cambridge University Press:  17 April 2009

D.G. Mahajan
Affiliation:
Department of Mathematics, Indian Institute of Technology, Bombay, India.
M.N. Vartak
Affiliation:
Department of Mathematics, Indian Institute of Technology, Bombay, India.
Rights & Permissions [Opens in a new window]

Extract

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.

Weak duality and direct duality theorems are proved, under appropriate assumptions, for the following pair of programming problems in complex space:

The objective function may be nondifferentiable and the constraints are of a more general nature than those considered earlier by various authors. Several well-known results are shown to be special cases of the results proved here.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1976