Bi-level programming techniques are developed to handle decentralized problems with two-level decision makers, leaders and followers, who may have more than one objective to achieve. This paper proposes a λ-cut and goal programming based algorithm to solve fuzzy linear multiple objective bi-level (FLMOB) decision problems. First, based on the definition of a distance measure between two fuzzy v...

In the classical problems of mathematical programming the coefficients are assumed to be exactly known. This assumption is seldom satisfied by great majority of real-life problems. Starting from the idea of K.D. Jamison and W.A. Lodwick which solve a fuzzy linear programming problem (2001), a linear fractional programming problem with fuzzy coefficients is described and a solving algorithm is o...

This article examines a new approach which solves Linear Programming (LP) problems with stochastic parameters as a generalized model of the fuzzy mathematical model analyzed by Verdegay. An expectation model is provided for solving the problem. A multi-parametric programming is applied to access to a solution with different desired degrees as well as problem constraints. Additionally, we presen...

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

Quadratic programming can be seen both as a general approach to linear programming and a special class of non-linear programming. Moreover, quadratic programming problems are of utmost importance in an increasing variety of practical fields, such as, regression, efficient production and portfolio selection. As ambiguity and vagueness are natural and ever-present in real-life situations requirin...

in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...

This paper deals with boolean linear programming problems involving coefficients in the objective function as fuzzy numbers. In the study of these problems different approaches can be proposed to use ranking fuzzy numbers methods and fuzzy preference relations obtaining auxiliary classical boolean programming problems, and to use the representation theorem obtaining a convex set with extreme po...

Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic ...