On portfolio optimization using fuzzy decisions

We consider stochastic optimization problems involving stochastic dominance constraints. We develop portfolio optimization model involving stochastic dominance constrains using fuzzy decisions and we concentrate on fuzzy linear programming problems with only fuzzy technological coefficients and aplication/implementation of modified subgradient method to fuzy linear programming problems. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Mehar’s method for solving fully fuzzy linear programming problems with L-R fuzzy parameters

To the best of our knowledge, there is no method in literature for solving such fully fuzzy linear programming (FLP) problems in which some or all the parameters are represented by unrestricted L-R flat fuzzy numbers. Also, to propose such a method, there is need to find the product of unrestricted L-R flat fuzzy numbers. However, there is no method in the literature to find the product of unrestricted L-R flat fuzzy numbers.In this paper, firstly the product of unrestricted L-R flat fuzzy numbers is proposed and then with the help of proposed product, a new method (named as Mehar’s method) is proposed for solving fully FLP problems. It is also shown that the fully FLP problems which can be solved by the existing methods can also be solved by the Mehar’s method. However, such fully FLP problems in which some or all the parameters are represented by unrestricted L-R flat fuzzy numbers can be solved by Mehar’s method but can not be solved by any of the existing methods.     

An interval approach based on expectation optimization for fuzzy random bilevel linear programming problems

This paper considers a class of bilevel linear programming problems in which the coefficients of both objective functions are fuzzy random variables. The main idea of this paper is to introduce the Pareto optimal solution in a multi-objective bilevel programming problem as a solution for a fuzzy random bilevel programming problem. To this end, a stochastic interval bilevel linear programming problem is first introduced in terms of α-cuts of fuzzy random variables. On the basis of an order relation of interval numbers and the expectation optimization model, the stochastic interval bilevel linear programming problem can be transformed into a multi-objective bilevel programming problem which is solved by means of weighted linear combination technique. In order to compare different optimal solutions depending on different cuts, two criterions are given to provide the preferable optimal solutions for the upper and lower level decision makers respectively. Finally, a production planning problem is given to demonstrate the feasibility of the proposed approach.     

Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra

 We consider stochastic programming problems with probabilistic constraints involving random variables with discrete distributions. They can be reformulated as large scale mixed integer programming problems with knapsack constraints. Using specific properties of stochastic programming problems and bounds on the probability of the union of events we develop new valid inequalities for these mixed integer programming problems. We also develop methods for lifting these inequalities. These procedures are used in a general iterative algorithm for solving probabilistically constrained problems. The results are illustrated with a numerical example. Received: October 8, 2000 / Accepted: August 13, 2002 Published online: September 27, 2002 Key words. stochastic programming – integer programming – valid inequalities     

Concavity and efficient points of discrete distributions in probabilistic programming

We consider stochastic programming problems with probabilistic constraints involving integer-valued random variables. The concept of a p-efficient point of a probability distribution is used to derive various equivalent problem formulations. Next we introduce the concept of r-concave discrete probability distributions and analyse its relevance for problems under consideration. These notions are used to derive lower and upper bounds for the optimal value of probabilistically constrained stochastic programming problems with discrete random variables. The results are illustrated with numerical examples. Received: October 1998 / Accepted: June 2000?Published online October 18, 2000     

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.     

Probability maximization models for portfolio selection under ambiguity

This paper considers several probability maximization models for multi-scenario portfolio selection problems in the case that future returns in possible scenarios are multi-dimensional random variables. In order to consider occurrence probabilities and decision makers’ predictions with respect to all scenarios, a portfolio selection problem setting a weight with flexibility to each scenario is proposed. Furthermore, by introducing aspiration levels to occurrence probabilities or future target profit and maximizing the minimum aspiration level, a robust portfolio selection problem is considered. Since these problems are formulated as stochastic programming problems due to the inclusion of random variables, they are transformed into deterministic equivalent problems introducing chance constraints based on the stochastic programming approach. Then, using a relation between the variance and absolute deviation of random variables, our proposed models are transformed into linear programming problems and efficient solution methods are developed to obtain the global optimal solution. Furthermore, a numerical example of a portfolio selection problem is provided to compare our proposed models with the basic model.     

Stochastic spanning tree problem

The minimal spanning tree problem has been well studied and until now many efficient algorithms such as [5,6] have been proposed. This paper generalizes it toward a stochastic version, i.e., considers a stochastic spanning tree problem in which edge costs are not constant but random variables and its objective is to find an optimal spanning tree satisfying a certain chance constraint. This problem may be considered as a discrete version of P-model first introduced by Kataoka [4].First it is transformed into its deterministic equivalent problem P. Then, an auxiliary problem P(R) with a positive parameter R is defined. After clarifying close relations between P and P(R), this paper proposes a polynomial order algorithm fully utilizing P(R). Finally, more improvement of the algorithm and applicability of this type algorithm to other discrete stochastic programming problems are discussed.     

An interactive fuzzy satisficing method for multiobjective stochastic linear programming problems through an expectation model

For decision making problems involving uncertainty, both stochastic programming as an optimization method based on the theory of probability and fuzzy programming representing the ambiguity by fuzzy concept have been developing in various ways. In this paper, we focus on multiobjective linear programming problems with random variable coefficients in objective functions and/or constraints. For such problems, as a fusion of these two approaches, after incorporating fuzzy goals of the decision maker for the objective functions, we propose an interactive fuzzy satisficing method for the expectation model to derive a satisficing solution for the decision maker. An illustrative numerical example is provided to demonstrate the feasibility of the proposed method.     

Stackelberg solutions for fuzzy random two-level linear programming through level sets and fractile criterion optimization

This paper considers Stackelberg solutions for two-level linear programming problems under fuzzy random environments. To deal with the formulated fuzzy random two-level linear programming problem, an α-stochastic two-level linear programming problem is defined through the introduction of α-level sets of fuzzy random variables. Taking into account vagueness of judgments of decision makers, fuzzy goals are introduced and the α-stochastic two-level linear programming problem is transformed into the problem to maximize the satisfaction degree for each fuzzy goal. Through fractile criterion optimization in stochastic programming, the transformed stochastic two-level programming problem can be reduced to a deterministic two-level programming problem. An extended concept of Stackelberg solution is introduced and a numerical example is provided to illustrate the proposed method.     

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.     

随机模糊的等比例-最小方差投资组合优化研究

Markowitz的均值-方差模型在投资组合优化中得到了广泛的运用和拓展,其中多数拓展模型仅局限于对随机投资组合或模糊投资组合的研究,而忽略了实际问题同时包含了随机信息和模糊信息两个方面。本文首先定义随机模糊变量的方差用以度量投资组合的风险,提出具有阀值约束的最小方差随机模糊投资组合模型,基于随机模糊理论,将该模型转化为具有线性等式和不等式约束的凸二次规划问题。为了提高上述模型的有效性,本文以投资者期望效用最大化为压缩目标对投资组合权重进行压缩,构建等比例-最小方差混合的随机模糊投资组合模型,并求解该模型的最优解。最后,运用滚动实际数据的方法,比较上述两个模型的夏普比率以验证其有效性。     

A new data envelopment analysis model with fuzzy random inputs and outputs

This paper first presents several formulas for mean chance distributions of triangular fuzzy random variables and their functions, then develops a new class of fuzzy random data envelopment analysis (FRDEA) models with mean chance constraints, in which the inputs and outputs are assumed to be characterized by fuzzy random variables with known possibility and probability distributions. According to the established formulas for the mean chance distributions, we can turn the mean chance constraints into their equivalent stochastic ones. On the other hand, since the objective in the FRDEA model is the expectation about the ratio of the weighted sum of outputs and the weighted sum of inputs for a target decision-making unite (DMU), for general fuzzy random inputs and outputs, we suggest an approximation method to evaluate the objective; and for triangular fuzzy random inputs and outputs, we propose a method to reduce the objective to its equivalent stochastic one. As a consequence, under the assumption that the inputs and the outputs are triangular fuzzy random vectors, the proposed FRDEA model can be reduced to its equivalent stochastic programming one, in which the constraints contain the standard normal distribution function, and the objective is the expectation for a function of the normal random variable. To solve the equivalent stochastic programming model, we design a hybrid algorithm by integrating stochastic simulation and genetic algorithm (GA). Finally, one numerical example is presented to demonstrate the proposed FRDEA modeling idea and the effectiveness of the designed hybrid algorithm.     

Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization

In this paper, we consider the stochastic mathematical programs with linear complementarity constraints, which include two kinds of models called here-and-now and lower-level wait-and-see problems. We present a combined smoothing implicit programming and penalty method for the problems with a finite sample space. Then, we suggest a quasi-Monte Carlo approximation method for solving a problem with continuous random variables. A comprehensive convergence theory is included as well. We further report numerical results with the so-called picnic vender decision problem.     

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.     

A new linearization technique for multi-quadratic 0-1 programming problems

We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variables remains the same.     

Imprecise stochastic orders and fuzzy rankings

We extend the notion of stochastic order to the pairwise comparison of fuzzy random variables. We consider expected utility, stochastic dominance and statistical preference, which are related to the comparisons of the expectations, distribution functions and medians of the underlying variables, and discuss how to generalize these notions to the fuzzy case, when an epistemic interpretation is given to the fuzzy random variables. In passing, we investigate to which extent the earlier extensions of stochastic dominance and expected utility to the comparison of sets of random variables can be useful as fuzzy rankings.     

An L 2-theory for a class of SPDEs driven by Lévy processes

In this paper we present an L 2-theory for a class of stochastic partial differential equations driven by Lévy processes.The coefficients of the equations are random functions depending on time and space variables,and no smoothness assumption of the coefficients is assumed.     

Analysis of critical paths in a project network with fuzzy activity times

This paper proposes an approach to critical path analysis for a project network with activity times being fuzzy numbers, in that the membership function of the fuzzy total duration time is constructed. The basic idea is based on the extension principle and linear programming formulation. A pair of linear programs parameterized by possibility level α is formulated to calculate the lower and upper bounds of the fuzzy total duration time at α. By enumerating different values of α, the membership function of the fuzzy total duration time is constructed, and the fuzzy critical paths are identified at the same time. Moreover, by applying the Yager ranking method, definitions of the most critical path and the relative degree of criticality of paths are developed; and these definitions are theoretically sound and easy to use in practice. Two examples with activity times being fuzzy numbers of L-R and L-L types discussed in previous studies are solved successfully to demonstrate the validity of the proposed approach. Since the total duration time is completely expressed by a membership function rather than by a crisp value, the fuzziness of activity times is conserved completely, and more information is provided for critical path analysis.     

A class of multiobjective linear programming models with random rough coefficients

In the present paper, we concentrate on dealing with a class of multiobjective programming problems with random rough coefficients. We first discuss how to turn a constrained model with random rough variables into crisp equivalent models. Then an interactive algorithm which is similar to the interactive fuzzy satisfying method is introduced to obtain the decision maker’s satisfying solution. In addition, the technique of random rough simulation is applied to deal with general random rough objective functions and random rough constraints which are usually hard to convert into their crisp equivalents. Furthermore, combined with the techniques of random rough simulation, a genetic algorithm using the compromise approach is designed for solving a random rough multiobjective programming problem. Finally, illustrative examples are given in order to show the application of the proposed models and algorithms.