Decomposition of the fuzzy parametric space in multiobjective nonlinear programming problems

This paper deals with a method for decomposing the fuzzy parametric space in multiobjective nonlinear programming problems using the generalized Tchebycheff norm. This approach is simpler than the corresponding one using the nonnegative weighted sum of objectives. Also, several results are introduced which relate two fuzzy programs with each other, one with fuzzy parameters in the constraints and the other with fuzzy parameters in both objective functions and constraints. These fuzzy parameters are characterized by fuzzy numbers. The existing results concerning the decomposition of parametric space in multiobjective convex programs using the generalized Tchebycheff norm are reformulated to study under the concept of α-pareto optimality. Such results make the study of the first type of problems rather simple. Three illustrated examples are presented in the paper which clarify the developed theory.     

On fuzzy random multiobjective quadratic programming

In this paper, a multiobjective quadratic programming problem having fuzzy random coefficients matrix in the objective and constraints and the decision vector are fuzzy pseudorandom variables is considered. First, we show that the efficient solutions of fuzzy quadratic multiobjective programming problems are resolved into series-optimal-solutions of relative scalar fuzzy quadratic programming. Some theorems are proved to find an optimal solution of the relative scalar quadratic multiobjective programming with fuzzy coefficients, having decision vectors as fuzzy variables. At the end, numerical examples are illustrated in the support of the obtained results.     

Solving the multiobjective possibilistic linear programming problem

In conventional multiobjective decision making problems, the estimation of the parameters of the model is often a problematic task. Normally they are either given by the decision maker (DM), who has imprecise information and/or expresses his considerations subjectively, or by statistical inference from past data and their stability is doubtful. Therefore, it is reasonable to construct a model reflecting imprecise data or ambiguity in terms of fuzzy sets for which a lot of fuzzy approaches to multiobjective programming have been developed. In this paper we propose a method to solve a multiobjective linear programming problem involving fuzzy parameters (FP-MOLP), whose possibility distributions are given by fuzzy numbers, estimated from the information provided by the DM. As the parameters, intervening in the model, are fuzzy the solutions will be also fuzzy. We propose a new Pareto Optimal Solution concept for fuzzy multiobjective programming problems. It is based on the extension principle and the joint possibility distribution of the fuzzy parameters of the problem. The method relies on α-cuts of the fuzzy solution to generate its possibility distributions. These ideas are illustrated with a numerical example.     

A note on chance constrained programming with fuzzy coefficients

This paper deals with nonlinear chance constrained programming as well as multiobjective case and goal programming with fuzzy coefficients occurring in not only constraints but also objectives. We also present a fuzzy simulation technique for handling fuzzy objective constraints and fuzzy goal constraints. Finally, a fuzzy simulation based genetic algorithm is employed to solve a numerical example.     

A class of multiobjective linear programming model with fuzzy random coefficients

The aim of this paper is to deal with a multiobjective linear programming problem with fuzzy random coefficients. Some crisp equivalent models are presented and a traditional algorithm based on an interactive fuzzy satisfying method is proposed to obtain the decision maker’s satisfying solution. In addition, the technique of fuzzy random simulation is adopted to handle general fuzzy random objective functions and fuzzy random constraints which are usually hard to be converted into their crisp equivalents. Furthermore, combined with the techniques of fuzzy random simulation, a genetic algorithm using the compromise approach is designed for solving a fuzzy random multiobjective programming problem. Finally, illustrative examples are given in order to show the application of the proposed models and algorithms.     

A fuzzy shortest path with the highest reliability

This paper concentrates on a shortest path problem on a network where arc lengths (costs) are not deterministic numbers, but imprecise ones. Here, costs of the shortest path problem are fuzzy intervals with increasing membership functions, whereas the membership function of the total cost of the shortest path is a fuzzy interval with a decreasing linear membership function. By the max–min criterion suggested in [R.E. Bellman, L.A. Zade, Decision-making in a fuzzy environment, Management Science 17B (1970) 141–164], the fuzzy shortest path problem can be treated as a mixed integer nonlinear programming problem. We show that this problem can be simplified into a bi-level programming problem that is very solvable. Here, we propose an efficient algorithm, based on the parametric shortest path problem for solving the bi-level programming problem. An illustrative example is given to demonstrate our proposed algorithm.     

An interactive fuzzy satisficing method for random fuzzy multiobjective integer programming problems through probability maximization with possibility

This paper considers multiobjective integer programming problems where each coefficient of the objective functions is expressed by a random fuzzy variable. A new decision making model is proposed by incorporating the concept of probability maximization into a possibilistic programming model. For solving transformed deterministic problems, genetic algorithms with double strings for nonlinear integer programming problems are introduced. An interactive fuzzy satisficing method is presented for deriving a satisficing solution to a decision maker by updating the reference probability levels. An illustrative numerical example is provided to clarify the proposed method.     

模糊规划的Hopfield网络方法

首先将一类模糊规划转化为无约束多目标规划，再依据决策者偏好并采用Hopfield网络方法构造该多目标规划的评价函数，从而将模糊规划转化为无约束单目标规划来求解．     

An interactive fuzzy satisficing method for structured multiobjective linear fractional programs with fuzzy numbers

In this paper, by considering the experts' vague or fuzzy understanding of the nature of the parameters in the problem formulation process, multiobjective linear fractional programming problems with block angular structure involving fuzzy numbers are formulated. Using the a-level sets of fuzzy numbers, the corresponding nonfuzzy a-multiobjective linear fractional programming problem is introduced. The fuzzy goals of the decision maker for the objective functions are quantified by eliciting the corresponding membership functions including nonlinear ones. Through the introduction of extended Pareto optimality concepts, if the decision maker specifies the degree a and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the minimax problems for which the Dantzig-Wolfe decomposition method and Ritter's partitioning procedure are applicable. Then a linear programming-based interactive fuzzy satisficing method with decomposition procedures for deriving a satisficing solution for the decision maker efficiently from an extended Pareto optimal solution set is presented. An illustrative numerical example is provided to demonstrate the feasibility of the proposed method.     

A Solution Concept for Fuzzy Multiobjective Programming Problems Based on Convex Cones

A solution concept for fuzzy multiobjective programming problems based on ordering cones (convex cones) is proposed in this paper. The notions of ordering cones and partial orderings on a vector space are essentially equivalent. Therefore, the optimality notions in a real vector space can be elicited naturally by invoking a concept similar to that of the Pareto-optimal solution in vector optimization problems. We introduce a corresponding multiobjective programming problem and a weighting problem of the original fuzzy multiobjective programming problem using linear functionals so that the optimal solution of its corresponding weighting problem is also the Pareto-optimal solution of the original fuzzy multiobjective programming problem.     

Fuzzy goal programming for multiobjective transportation problems

Several fuzzy approaches can be considered for solving multiobjective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach.     

基于模糊需求的多产品供应商选择的多目标规划模型

由决策于环境的不确定性,供应商选择问题存在大量的模糊信息,传统的确定性规划模型已经不能够很好地处理此类问题。本文基于模糊需求量信息,对于多产品供应商问题建立了模糊多目标规划模型。同时考虑到各目标及约束的重要性程度不同的影响,通过引进适当的权重对多目标规划模型进行求解。文中结合实际算例验证模型的可行性和有效性。     

Interactive multiobjective fuzzy random linear programming: Maximization of possibility and probability

This paper considers multiobjective linear programming problems with fuzzy random variables coefficients. A new decision making model is proposed to maximize both possibility and probability, which is based on possibilistic programming and stochastic programming. An interactive algorithm is constructed to obtain a satisficing solution satisfying at least weak Pareto optimality.     

一类模糊非线性方程组及解法

模糊非线性方程组 ,在模糊控制和现实生活中很普遍 .本文考虑一类模糊非线性方程组的性质 ,然后给出一种解法 .首先把模糊非线性方程组转变成非线性规划 ,再用非线性规划中的方法或软件来解 .     

An elaborative unit cost structure-based fuzzy economic production quantity model

The purpose of this paper is to investigate and propose a fuzzy extended economic production quantity model based on an elaboratively modeled unit cost structure. This unit cost structure consists of the various lot-size correlative components such as on-line setups, off-line setups, initial production defectives, direct material, labor, and depreciation in addition to lot-size non-correlative items. Thus, the unit cost is correlatively modeled to the production quantity. Therefore, the modeling or the annual total cost function developed consists of not only annual inventory and setup costs but also production cost. Moreover, via the concept of fuzzy blurred optimal argument and the vertex method of the α-cut fuzzy arithmetic (or fuzzy interval analysis), two solution approaches are proposed: (1) a fuzzy EPQ and (2) a compromised crisp EPQ in the fuzzy sense. An optimization procedure, which can simultaneously determine the α-cut-vertex combination of fuzzy parameters and the optimizing decision variable value, is also proposed. The sensitivity model for the fuzzy total cost and thus EPQ to the various cost factors is provided. Finally, a numerical example with the original data collected from a firm demonstrates the usefulness of the new model.     

Fuzzy costs in quadratic programming problems

Although quadratic programming problems are a special class of nonlinear programming, they can also be seen as general linear programming problems. These quadratic problems are of the utmost importance in an increasing variety of practical fields. As, in addition, ambiguity and vagueness are natural and ever-present in real-life situations requiring operative solutions, it makes perfect sense to address them using fuzzy concepts formulated as quadratic programming problems with uncertainty, i.e., as Fuzzy Quadratic Programming problems. This work proposes two novel fuzzy-sets-based methods to solve a particular class of Fuzzy Quadratic Programming problems which have vagueness coefficients in the objective function. Moreover, two other linear approaches are extended to solve the quadratic case. Finally, it is shown that the solutions reached from the extended approaches may be obtained from two proposed parametric multiobjective approaches.     

Solutions of Fuzzy Multiobjective Programming Problems Based on the Concept of Scalarization

Scalarization of fuzzy multiobjective programming problems using the embedding theorem and the concept of convex cone (ordering cone) is proposed in this paper. Since the set of all fuzzy numbers can be embedded into a normed space, this motivation naturally inspires us to invoke the scalarization techniques in vector optimization problems to evaluate the a multiobjective programming problem. Two solution concepts are proposed in this paper by considering different convex cones.     

Editorial

Linear programming problems with fuzzy parameters are formulated by fuzzy functions. The ambiguity considered here is not randomness, but fuzziness which is associated with the lack of a sharp transition from membership to nonmembership. Parameters on constraint and objective functions are given by fuzzy numbers. In this paper, our object is the formulation of a fuzzy linear programming problem to obtain a reasonable solution under consideration of the ambiguity of parameters. This fuzzy linear programming problem with fuzzy numbers can be regarded as a model of decision problems where human estimation is influential.     

A kind of fuzzy linear programming problems based on interval-valued fuzzy sets

Abstract. The objective of this paper is to deal with a kind of fuzzy linear programming problem based on interval-valued fuzzy sets (IVFLP) through the medium of procedure that turns IVFLP into parametric linear programming via the mathematical programming. Some useful results for the benefit of solving IVFLP are expounded and proved,developed and discussed. Furthermore,that the proposed techniques in this paper allow the decision-maker to assign a different degree of importance can provide a useful way to efficiently help the decision-maker make their decisions.