Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T04:54:03.571Z Has data issue: false hasContentIssue false

On duality in complex linear programming

Published online by Cambridge University Press:  09 April 2009

B. D. Craven
Affiliation:
University of MelbourneMelbourne, Australia.
B. Mond
Affiliation:
La Trobe University Bundoora, Vic., Australia.
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.

In [3], Levinson proved a duality theorem for linear programming in complex space. Ben-Israel [1] generalized this result to polyhedral convex cones in complex space. In this paper, we give a simple proof of Ben-Israel's result based directly on the duality theorem for linear programming in real space. The explicit relations shown between complex and real linear programs should be useful in actually computing a solution for the complex case. We also give a simple proof of Farkas' theorem, generalized to polyhedral cones in complex space ([1], Theorem 3.5); the proof depends only on the classical form of Farkas' theorem for real space.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1973