Downloads & Free Reading Options - Results

Fuzzy multiobjective linear bilevel programming (FMOLBP) problems are studied in this paper. The existing methods replace one or some deterministic model(s) instead of the problem and solve the model(s). Doing this work, we lose much information about the compromise decision, and it does not make sense for the uncertain conditions. To overcome the difficulties, Zadeh’s extension principle is applied to solve the FMOLBP problems. Two crisp multiobjective linear three-level programming problems are proposed to find the lower and upper bound of its objective values in different levels. The problems are reduced to some linear optimization problems using one of the scalarization approaches, called the weighting method, the dual theory, and the vertex enumeration method. The lower and upper bounds are estimated by the resolution of the corresponding linear optimization problems. Hence, the membership functions of compromise objective values are produced, which is the main contribution of this paper. This technique is applied for the problem for the first time. This method applies all information of a fuzzy number and does not estimate it by a crisp number. Hence, the compromise decision resulted from the proposed method is consistent with reality. This point can minimize the gap between theory and practice. The results are compared with the results of existing approaches. It shows the efficiency of the proposed approach.

Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial interior point methodology to find the set of Pareto-optimal solutions of MOLP.

FUZZY, IEEE TRAN. REVIEW WAITING.

A key problem in multiobjective linear programming is to find the set of all efficient extreme points in objective space. In this paper we introduce oriented projective geometry as an efficient and effective framework for solving this problem. The key advantage of oriented projective geometry is that we can work with an "optimally simple" but unbounded efficiency-equivalent polyhedron, yet apply to it the familiar theory and algorithms that are traditionally restricted to bounded polytopes. We apply these techniques to Benson's outer approximation algorithm, using oriented projective geometry to remove an exponentially large complexity from the algorithm and thereby remove a significant burden from the running time.

This paper presents algorithms for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated solutions for the problem. Theoretical complexity results on the algorithm are provided in the paper. Specifically, we prove that encoding the entire set of nondominated solutions of the problem is polynomially doable, when the dimension of the decision space is fixed. In addition, we provide polynomial delay algorithms for enumerating this set. An implementation of the algorithm shows that it is useful for solving multiobjective integer linear programs.

The existence of neutral /indeterminacy degrees reflects the more practical aspects of decision-making scenarios. Thus, this paper has studied the intuitionistic fuzzy multiobjective linear programming problems (IFMOLPPs) under neutrosophic uncertainty. To highlight the degrees of neutrality in IFMOLPPs, we have investigated the neutrosophic optimization techniques with intuitionistic fuzzy parameters. The marginal evaluation of each objective is determined by three different membership functions, such as truth, indeterminacy, and falsity membership degrees under the neutrosophic environment. The marginal evaluation of each objective function is elicited by various sorts of membership functions such as linear, exponential, and hyperbolic types of membership functions, which signifies an opportunity for decision-makers to select the desired membership functions. The developed neutrosophic optimization technique is implemented on existing numerical problems that reveal the validity and applicability of the proposed methods. A comparative study is also presented with other approaches. At last, conclusions and future research directions are addressed based on the proposed work.