Two-dimensional Second-Order Cone Programming
by Yu Xia
International Journal of Operational Research (IJOR), Vol. 5, No. 4, 2009

Abstract: We show that the primal and dual 2-dimensional second-order cone programs in standard form are equivalent to the standard-form primal and dual linear programs via a linear transformation. We show how variables in the Second-Order Cone (SOC) programs and the linear programs are related by the transformation. Based on the transformation, we interpret the simplex method for two-dimensional Second-Order Cone Programming (SOCP). We show how pivot steps change the states of variables among interior, boundary, and zero. Finally, we give some applications of two-dimensional SOCP.

Online publication date: Sat, 23-May-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com