%0 Journal Article %A Mirdehghan, S. M. %A Mehdiloo, M. %T Finding a relative interior point of a polyhedron using linear programming: Application to geometric programming %J Journal of Operational Research and Its Applications %V 15 %N 3 %U http://jamlu.liau.ac.ir/article-1-1242-en.html %R %D 2018 %K Polyhedral set, Face, Relative Interior, Linear Programming, Geometric Programming., %X One of the fundamental concepts in convex analysis and optimization is the relative interior of a set. This concept is used when the interior of a set is empty due to the incompleteness of its dimension. In this paper, first, we propose a linear programming model to find a relative interior point of a polyhedral set. Then, we discuss the application of this model to geometric programming. Specifically, we show that a special form of our proposed model can determine the degeneracy of a geometric programming problem by identifying a relative interior point of the feasible region of its dual. Finally, we present two numerical examples for describing the applications of the proposed model. %> http://jamlu.liau.ac.ir/article-1-1242-en.pdf %P 1-13 %& 1 %! %9 Research %L A-11-1053-1 %+ Department of Mathematics, College of Sciences, Shiraz University, Shiraz, Iran %G eng %@ 2251-7286 %[ 2018