Abstract
This paper discusses the geometric properties of the intersection of SOCP problem constraints in case R2 and R3. SOCP Problem is one developing problem of linear programming where cone equalities or inequalities are as the constraints. If in linear programming problem, we can only concern to the optimal solution of the problem. However, the results of the intersection in SOCP require more serious observation. It is because of the cone-shaped constraints needed more guarantee of the convexity. The geometric properties of the intersection of SOCP problem constraints are 1.) Convex spaces in R2 and R3, 2.) Finite region, infinite region, finite space, or infinite space, and 3.) A polygon in R2 and not a polyhedron in R3.
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 call
