Open AccessGeometric properties of SOCP problem constraints on ℝ2 and ℝ3
Author(s) -
Caturiyati,
H P Lestari,
Kus Prihantoso Krisnawan
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1581/1/012002
Subject(s) - intersection (aeronautics) , convexity , polyhedron , mathematics , regular polygon , second order cone programming , linear programming , space (punctuation) , combinatorics , cone (formal languages) , linear space , mathematical optimization , convex optimization , discrete mathematics , computer science , geometry , algorithm , financial economics , engineering , economics , aerospace engineering , operating system
This paper discusses the geometric properties of the intersection of SOCP problem constraints in case R 2 and R 3 . 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 R 2 and R 3 , 2.) Finite region, infinite region, finite space, or infinite space, and 3.) A polygon in R 2 and not a polyhedron in R 3 .