An algorithm for finding a vector in the intersection of open convex polyhedral cones
- 29 Downloads
This paper establishes necessary and sufficient conditions for the intersection ofm open convex polyhedral cones to be nonempty. An algorithm is given which indicates if the intersection is empty or not, and eventually computes a vector in the intersection.
KeywordsComputational Mathematic Open Convex Polyhedral Cone Convex Polyhedral Convex Polyhedral Cone
Unable to display preview. Download preview PDF.
- 1.J. C. G. Boot,Quadratic Programming, North-Holland Publishing Company, Amsterdam, 1964.Google Scholar
- 2.M. Boyer, S. Storøy and S. Thore,Equilibrium Returns in Capital Market Networks, to be published.Google Scholar
- 3.O. L. Mangasarian,Nonlinear Programming, McGraw-Hill Book Company, 1969.Google Scholar