we present a new model and a new approach for solving fuzzylinear programming (flp) problems with various utilities for the satisfactionof the fuzzy constraints. the model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (dm), andallows for the assignment of distinct weights to the constraints and the objectivefunction. the desired solutio...

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

the fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. a linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. in contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...

A class of fuzzy linear programming (FLP) problems with fuzzy coefficients based on fuzzy relations is introduced, the concepts of feasible and (α, β)-maximal and minimal solutions are defined. The class of crisp (classical) LP problems can be embedded into the class of FLP ones. Moreover, for FLP problems a new concept of duality is introduced and the weak and strong duality theorems are deriv...

This article considers bilevel linear programming problems where the coefficients of the objective functions in the problem are given as a possibilistic variable characterized by a quadratic membership function. An extended Stackelberg solution is defined by incorporating the notions of possibility theory into the original concept of Stackelberg solutions. The characteristic of the proposed mod...

in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

In this paper a wide class of discrete optimization problems, which can be formulated as a 0-1 linear programming problem is discussed. It is assumed that the objective function costs are not precisely known. This uncertainty is modeled by specifying a finite set of fuzzy scenarios. Under every fuzzy scenario the costs are given as fuzzy intervals. Possibility theory is then applied to chose a ...