Volume 15, Issue 3 (11-2018)                   2018, 15(3): 1-13 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Mirdehghan S M, Mehdiloo M. Finding a relative interior point of a polyhedron using linear programming: Application to geometric programming. Journal of Operational Research and Its Applications. 2018; 15 (3) :1-13
URL: http://jamlu.liau.ac.ir/article-1-1242-en.html
Department of Mathematics, College of Sciences, Shiraz University, Shiraz, Iran
Abstract:   (2148 Views)

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.

Full-Text [PDF 887 kb]   (1530 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/05/7 | Accepted: 2018/01/6 | Published: 2018/11/15

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.