Search published articles


Showing 2 results for Mirdehghan
Finding a relative interior point of a polyhedron using linear programming: Application to geometric programming
S. M. Mirdehghan, M. Mehdiloo,
Volume 15, Issue 3 (11-2018)
Abstract

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.
 


Finding the Efficient Solutions of Multiobjective Linear Fractional Programming Problems with Fuzzy Coefficients in Constraints and Vector of Resources
H. Rostamzadeh, S. M. Mirdehghan,
Volume 18, Issue 1 (3-2021)
Abstract
Multiobjective linear fractional programming (MOLFP) problems are the important problems with special structure in multiobjective optimization. In the MOLFP problems the objective functions are linear fractional functions and the constraints are linear, i.e., the feasible set is a polyhedron. In a MOLFP problem, let the coefficients of the constraints and the vector of resources be fuzzy, which construct a fuzzy multiobjective linear fractional programming problem. In this paper, we suggest a method to identify the efficient solutions of a fuzzy MOLFP problem by introducing some linear programming problems.
Page 1 from 1