This paper proposes a bi-level linear programming problem with linear constraints, in which the linear objective functions are to be maximized with different rough goals, the suggested approach in this paper is mainly based on the iterative goal programming method of Dauer and Krueger to develop the optimal solution of the bi-level decisionmaker, then we uses the concepts of tolerance membershi...

The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. Information about real life systems is often available in the form of vague descriptions. Hence, fuzzy methods are designed to handle vague terms, and are most suited to finding optimal solutions to problems with vague parameters. This study develops a fuzzy multi-objective linear ...

In the present paper, the study of fully fuzzy linear fractional programming problem (FFLFPP) using graded mean integration representation method is discussed where all the parameters and variables are characterized by trapezoidal fuzzy numbers. A computational algorithm has been presented to obtain an optimal solution by applying simplex method. To demonstrate the applicability of the proposed...

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...

This paper presents a parametric approach for duality in fuzzy multi-criteria and multi-constraint level linear programming (MCLP) which extends fuzzy linear programming approaches. First, the MC-simplex method is used to solve the crisp prima–dual MCLP pair and then, through these crisp formulations, separate membership functions are constructed for fuzzy primal and dual program by considering...

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...

in traditional portfolio selection model coefficients often are certain and deterministic, but in real world these coefficients are probabilistic. so decision maker cannot estimate them exactly. financial optimization is one of the most attractive areas in decision under uncertainty. in the portfolio selection problem the decision maker considers simultaneously conflicting objectives such as ra...

In this paper, we consider multiobjective two-person zero-sum games with vector payoffs and vector fuzzy payoffs. We translate such games into the corresponding multiobjective programming problems and introduce the pessimistic Pareto optimal solution concept by assuming that a player supposes the opponent adopts the most disadvantage strategy for the self. It is shown that any pessimistic Paret...