具有模糊报酬的多目标马尔可夫决策规划

给出一种模糊多目标马尔可夫决策规划的定义,即当报酬是模糊函数时的多目标马尔可夫决策规划,并解决求解这种规划的最优策略的方法以及这种多目标规划最优解的判决问题。     

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

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

偏好信息为模糊互反判断矩阵的模糊多属性决策法

研究只有部分权重信息且决策者对方案的偏好信息以模糊互反判断矩阵形式给出的模糊多属性决策问题。提出了一种基于目标规划模型的模糊多属性决策方法。该法首先基于模糊互反判断矩阵，利用转换函数将决策信息一致化，建立了一个目标规划模型．通过求解该模型确定属性的权重，然后运用加性加权法求出各方案的模糊综合属性值，并利用已有的三角模糊数排序公式求得决策方案的排序。文章最后把该法应用于解决风险投资领域中的项目评估问题。     

模糊多目标规划的最小隶属度偏差法

对于可行域为有限集的模糊多目标规划问题，本文给出一个新的解法－－最小隶属度偏差值，并结合实例通过与“优序法”、“最短距离法”的对比分析，指出了使用“优序法”和“最短距离法”应注意的问题及新解决的有效性。     

垃圾填埋场选址问题的模糊数学模型研究

为有助于在环境和经济框架内评价垃圾填埋场选址决策,本文建立了关于该问题的多目标模型,模型中既考虑了安置和运营设施需要的固定成本和可变成本,也考虑了居民区承受的风险,以及各居民区承担风险的公平性。并进一步讨论了用模糊方法处理的一般多目标规划模型的模糊最优解与有效解及弱有效解之间的关系。最后使用两种模糊目标规划方法求解数值例子以分析所建模型的适用性,结果表明,加权模糊方法可以为决策者提供更接近期望值的满意方案。     

部分权重信息下对方案有互补偏好的多属性决策法

研究了只有部分权重信息且对方案的偏好信息以模糊互补判断矩阵形式给出的多属性决策问题.首先,基于模糊互补判断矩阵的主观偏好信息,利用转换函数将客观决策信息一致化,建立一个目标规划模型,通过求解该模型得到属性权重,从而利用加性加权法获得各方案的综合属性值,并以此对方案进行排序或择优.提出了一种基于目标规划的多属性决策方法.该方法具有操作简便和易于上机实现的特点.最后,通过实例说明模型及方法的可行性和有效性.     

多目标规划αk-较多有效解类的若干性质

在［１］中,作者提出多目标规划的较多有效解和较多最优解概念,并研究了它们的基本性质．文［３］则讨论了ｋ－较多最优解的若干性质．文［４］利用较多序类进一步引进多目标规划问题的αｋ－较多有效解,并证明了这类解的最优性必要条件．本文再给出多目标规划问题的αｋ－较多最优解的概念,并讨论了多目标规划αｋ－较多有效解和αｋ－较多最优解的若干重要性质．     

常态及故障条件下的多传感器任务管控调度研究

针对多传感器控制中的常态和故障情况问题,建立了描述常态和故障条件下的多传感器控制的多目标规划模型,通过偏离度指数,应用遗传算法求得常态控制问题最优解.其次将传感器故障转化成伪执行器故障运用改进的遗传算法,实现了多传感器故障情形下最优控制求解.仿真结果表明了最优控制方案的有效性.     

基于CVaR的次优拥挤收费随机多目标模型

次优拥挤收费问题一般要考虑不同决策者的不同利益,因此,有必要考虑多个收费策略建立多目标模型来均衡不同决策者的利益.由于决策者常在信息不确定的情况下做决策,在出行需求不确定的条件下,为了确定次优拥挤收费的方案,建立了基于条件风险价值的随机多目标双层规划模型,上层规划的目标函数考虑了系统总阻抗和社会公平性,下层规划是UE用户均衡配流问题.利用基于随机模拟的遗传算法对模型进行求解,并通过数值算例对模型和算法进行分析,验证了模型的有效性.     

基于CVaR的次优拥挤收费随机多目标模型北大核心

次优拥挤收费问题一般要考虑不同决策者的不同利益,因此,有必要考虑多个收费策略建立多目标模型来均衡不同决策者的利益.由于决策者常在信息不确定的情况下做决策,在出行需求不确定的条件下,为了确定次优拥挤收费的方案,建立了基于条件风险价值的随机多目标双层规划模型,上层规划的目标函数考虑了系统总阻抗和社会公平性,下层规划是UE用户均衡配流问题.利用基于随机模拟的遗传算法对模型进行求解,并通过数值算例对模型和算法进行分析,验证了模型的有效性.     

A method of solving fully fuzzified linear fractional programming problems

In this paper, we propose a method of solving the fully fuzzified linear fractional programming problems, where all the parameters and variables are triangular fuzzy numbers. We transform the problem of maximizing a function with triangular fuzzy value into a deterministic multiple objective linear fractional programming problem with quadratic constraints. We apply the extension principle of Zadeh to add fuzzy numbers, an approximate version of the same principle to multiply and divide fuzzy numbers and the Kerre’s method to evaluate a fuzzy constraint. The results obtained by Buckley and Feuring in 2000 applied to fractional programming and disjunctive constraints are taken into consideration here. The method needs to add extra zero-one variables for treating disjunctive constraints. In order to illustrate our method we consider a numerical example.     

Priority based fuzzy goal programming technique to fractional fuzzy goals using dynamic programming

This paper describes the use of preemptive priority based fuzzy goal programming method to fuzzy multiobjective fractional decision making problems under the framework of multistage dynamic programming. In the proposed approach, the membership functions for the defined objective goals with fuzzy aspiration levels are determined first without linearizing the fractional objectives which may have linear or nonlinear forms. Then the problem is solved recursively for achievement of the highest membership value (unity) by using priority based goal programming methodology at each decision stages and thereby identifying the optimal decision in the present decision making arena. A numerical example is solved to represent potentiality of the proposed approach.     

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.     

Fractional Goal Programming for Fuzzy Solid Transportation Problem with Interval Cost

In this paper, we study a solid transportation problem with interval cost using fractional goal programming approach (FGP). In real life applications of the FGP problem with multiple objectives, it is difficult for the decision-maker(s) to determine the goal value of each objective precisely as the goal values are imprecise, vague, or uncertain. Therefore, a fuzzy goal programming model is developed for this purpose. The proposed model presents an application of fuzzy goal programming to the solid transportation problem. Also, we use a special type of non-linear (hyperbolic) membership functions to solve multi-objective transportation problem. It gives an optimal compromise solution. The proposed model is illustrated by using an example.     

A revisit of numerical approach for solving linear fractional programming problem in a fuzzy environment

In the article, Veeramani and Sumathi [10] presented an interesting algorithm to solve a fully fuzzy linear fractional programming (FFLFP) problem with all parameters as well as decision variables as triangular fuzzy numbers. They transformed the FFLFP problem under consideration into a bi-objective linear programming (LP) problem, which is then converted into two crisp LP problems. In this paper, we show that they have used an inappropriate property for obtaining non-negative fuzzy optimal solution of the same problem which may lead to the erroneous results. Using a numerical example, we show that the optimal fuzzy solution derived from the existing model may not be non-negative. To overcome this shortcoming, a new constraint is added to the existing fuzzy model that ensures the fuzzy optimal solution of the same problem is a non-negative fuzzy number. Finally, the modified solution approach is extended for solving FFLFP problems with trapezoidal fuzzy parameters and illustrated with the help of a numerical example.     

Fuzzy Multi-fractional Programming for Land Use Planning in Agricultural Production System

In this paper, we present a multi-objective linear fractional programming (MOLFP) approach for multi-objective linear fuzzy goal programming (MOLFGP) problem. Here, we consider a problem in which a set of pair of goals are optimized in ratio rather than optimizing them individually. In particular, we consider the optimization of profit to cash expenditure and crop production in various seasons to land utilization as a fractional objectives and used remaining goals in its original form. Further, the goals set in agricultural production planning are conflicting in nature; thus we use the concept of conflict and nonconflict between goals for computation of appropriate aspiration level. The method is illustrated on a problem of agricultural production system for comparison with Biswas and Pal [1] method to show its suitability.     

Necessary optimality conditions for minimax programming problems with mathematical constraints

In this paper, necessary optimality conditions in terms of upper and/or lower subdifferentials of both cost and constraint functions are derived for minimax optimization problems with inequality, equality and geometric constraints in the setting of non-differentiatiable and non-Lipschitz functions in Asplund spaces. Necessary optimality conditions in the fuzzy form are also presented. An application of the fuzzy necessary optimality condition is shown by considering minimax fractional programming problem.     

A redundancy detection algorithm for fuzzy stochastic multi-objective linear fractional programming problems

The computational complexity of linear and nonlinear programming problems depends on the number of objective functions and constraints involved and solving a large problem often becomes a difficult task. Redundancy detection and elimination provides a suitable tool for reducing this complexity and simplifying a linear or nonlinear programming problem while maintaining the essential properties of the original system. Although a large number of redundancy detection methods have been proposed to simplify linear and nonlinear stochastic programming problems, very little research has been developed for fuzzy stochastic (FS) fractional programming problems. We propose an algorithm that allows to simultaneously detect both redundant objective function(s) and redundant constraint(s) in FS multi-objective linear fractional programming problems. More precisely, our algorithm reduces the number of linear fuzzy fractional objective functions by transforming them in probabilistic–possibilistic constraints characterized by predetermined confidence levels. We present two numerical examples to demonstrate the applicability of the proposed algorithm and exhibit its efficacy.     

A fuzzy goal programming approach to multi-objective optimization problem with priorities

In goal programming problem, the general equilibrium and optimization are often two conflicting factors. This paper proposes a generalized varying-domain optimization method for fuzzy goal programming (FGP) incorporating multiple priorities. According to the three possible styles of the objective function, the varying-domain optimization method and its generalization are proposed. This method can generate the results consistent with the decision-maker (DM)’s expectation, that the goal with higher priority may have higher level of satisfaction. Using this new method, it is a simple process to balance between the equilibrium and optimization, and the result is the consequence of a synthetic decision between them. In contrast to the previous method, the proposed method can make that the higher priority achieving the higher satisfactory degree. To get the global solution of the nonlinear nonconvex programming problem resulting from the original problem and the varying-domain optimization method, the co-evolutionary genetic algorithms (GAs), called GENOCOPIII, is used instead of the SQP method. In this way the DM can get the optimum of the optimization problem. We demonstrate the power of this proposed method by illustrative examples.     

A new risk criterion in fuzzy environment and its application

Since the observed values of security returns in real-world problems are sometimes imprecise or vague, an increasing effort in research is devoted to study the properties of risk measures in fuzzy portfolio optimization problems. In this paper, a new risk measure is suggested to gauge the risk resulted from fuzzy uncertainty. For this purpose, the absolute deviation and absolute semi-deviation are first defined for fuzzy variable by nonlinear fuzzy integrals. To compute effectively the absolute semi-deviations of single fuzzy variable as well as its functions, this paper discusses the methods of computing the absolute semi-deviation by classical Lebesgue–Stieltjes (L–S) integral. After that, several useful absolute deviation and absolute semi-deviation formulas are established for common triangular, trapezoidal and normal fuzzy variables. Applying the absolute semi-deviation as a new risk measure in portfolio optimization, three classes of fuzzy portfolio optimization models are developed by combining the absolute semi-deviation with expected value operator and credibility measure. Based on the analytical representation of absolute semi-deviations, the established fuzzy portfolio selection models can be turned into their equivalent piecewise linear or fractional programming problems. Since the absolute semi-deviation is a piecewise fractional function and pseudo-convex on the feasible subregions of deterministic programming models, we take advantage of the structural characteristics to design a domain decomposition method to separate a deterministic programming problem into three convex subproblems, which can be solved by conventional solution methods or general-purpose software. Finally, some numerical experiments are performed to demonstrate the new modeling idea and the effectiveness of the solution method.