Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
