A Two-Period Stochastic Linear Programming Game

Using different dominance criteria in stochastic fuzzy linear multiobjective programming: A case of fuzzy weighted objective function

Many planning problems involve choosing a set of optimal decisions for a system in the face of uncertainty of elements that may play a central role in the way the system is analyzed and operated. During the past decade, there has been a renewed interest in the modelling, analysis, and solution of such problems due to a remarkable development of both new theoretical results and novel computational techniques in stochastic optimization. A prominent approach is to develop upper and lower bounding approximations to the problem along with procedures to sharpen bounds until an acceptable tolerance is satisfied. The contributions of this dissertation are concerned with the latter approach. The thesis first studies the stochastic linear programming problem with randomness in both the objective coefficients and the constraints. A convex concave saddle property of the value function is utilized to derive new bounding techniques which generalize previously known results. These approximations require discretizing bounded domains of the random variables in such a way that tight upper and lower bounds result. Such techniques will prove attractive with the recent advances in large scale linear programming. The above results are also extended to obtain new upper and lower bounds when the domains of random variables are unbounded. While these bounds are tight, the approximating models are large-scale deterministic linear programs. In particular, with a proposed order-cone decomposition for the domains, these linear programs are well-structured, thus enabling one to use efficient techniques for solution, such as parallel computation. The thesis next considers convex stochastic programs. Using aggregation concepts from the deterministic literature, new bounds are developed for the problem which are computable using standard convex programming algorithms. Finally, the discussion is focused on a stochastic convex program arising in a certain resource allocation problem. Exploiting the problem structure, bounds are developed via the Karush-Kuhn-Tucker conditions. Rather than discretizing domains, these approximations advocate replacing difficult multidimensional integrals by a series of simple univariate integrals. Such practice allows one to preserve differentiability properties so that smooth convex programming methods can be applied for solution.

A general concept for solving linear multicriteria programming problems with crisp, fuzzy or stochastic values

A technique is developed for finding a closed form expression for the cumulative distribution function of the maximum value of the objective function in a stochastic linear programming problem, where either the objective function coefficients or the right hand side coefficients are continuous random vectors with known probability distributions. This is the “wait and see” problem of stochastic linear programming. Explicit results for the distribution problem are extremely difficult to obtain; indeed, previous results are known only if the right hand side coefficients have an exponential distribution [1]. To date, no explicit results have been obtained for stochastic c, and no new results of any form have appeared since the 1970’s. In this paper, we obtain the first results for stochastic c, and new explicit results if b an c are stochastic vectors with an exponential, gamma, uniform, or triangle distribution. A transformation is utilized that greatly reduces computational time.

Professional: comments on

We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These problems have been considered too large to solve with the simplex method; instead, decomposition approaches based on Benders decomposition or, more recently, interior-point methods are generally used. However, these approaches do not provide optimal basic solutions, which allow for efficient hot-starts (e.g., in a branch-and-bound context) and can provide important sensitivity information. Our approach exploits the dual block-angular structure of these problems inside the linear algebra of the revised simplex method in a manner suitable for high-performance distributed-memory clusters or supercomputers. While this paper focuses on stochastic LPs, the work is applicable to all problems with a dual block-angular structure. Our implementation is competitive in serial with highly efficient sparsity-exploiting simplex codes and achieves significant relative speed-ups when run in parallel. Additionally, very large problems with hundreds of millions of variables have been successfully solved to optimality. This is the largest-scale parallel sparsity-exploiting revised simplex implementation that has been developed to date and the first truly distributed solver. It is built on novel analysis of the linear algebra for dual block-angular LP problems when solved by using the revised simplex method and a novel parallel scheme for applying product-form updates.

ABSTRACTIn this paper, we consider a Fuzzy Stochastic Linear Fractional Programming problem (FSLFP). In this problem, the coefficients and scalars in the objective function are the triangular fuzzy number and technological coefficients and the quantities on the right side of the constraints are fuzzy random variables with the specific distribution. Here we change an FSLFP problem to an equivalent deterministic Multi-objective Linear Fractional Programming (MOLFP) problem. Then by using Fuzzy Mathematical programming approach transformed MOLFP problem is reduced single objective Linear programming (LP) problem. A numerical example is presented to demonstrate the effectiveness of the proposed method.

An ordinary linear programming model is said to be chance-constrained if its linear constraints are associated with a set of measures indicating the extent of violation of the constraints. The CCP approach usually assumes the resource vector to be normally and mutually independently distributed and then derives a deterministic concave programming problem. In the SLP approach the tolerance measure for the linear constraints is not preassigned by the decision maker and the approach seeks to derive the statistical distribution of the optimal solution vector and also of the optimal objective function under the assumption that the set (A, b, c) of parameters contains elements with known probability distributions. Some basic differences of the CCP and the SLP approaches may be noted at the outset. First, the CCP approach utilizes the distribution properties of relevant random variables statisfying preassigned tolerance limits to specify a deterministic nonlinear program, whereas the SLP approach starts from a deterministic linear program (e.g., a program where all random elements are replaced by their expected values) and admits the random variations around its optimal basis to derive the probability distribution of the optimal solution satisfying (if necessary at a later stage) some tolerance measures if and when feasible. Second, nonlinearities are introduced in both approaches, although the initial problem in both cases is a linear programming problem. Third, the CCP approach restricts decision rules within a certain class (e.g.,

For a class of stochastic linear bilevel programming problem, we firstly transform it into a deterministic linear bilevel covariance programming problem. Then, the deterministic bilevel covariance programming problem is solved by backpropagation artificial neural network based on elite particle swam optimization algorithm (BPANN-PSO). Finally, we perform the simulation experiments and the results show that the computational efficiency of the proposed algorithm has a potential upside compared with the classical algorithm.

Raw-materials base (hereinafter RMB) is one of the largest industries for financial investments in Russia. There are various mathematical descriptions for the development of regions with resource-based economy. Earlier in [1] the researchers considered the model based on bilevel integer stochastic programming problems with Boolean variables. This paper proposes a new approach to public-private partnership modelling, including a bilevel linear stochastic programming problem. This model assumes that budget constraints of the state and the investor can vary in a random manner with a specific probability distribution. We put forward two methods to solve this problem: problem’s reduction to the deterministic bilevel one and formulation of deterministic problems sequence with help of Monte Carlo methods. In order to solve deterministic problems of integer programming, we suggest two approaches: direct enumeration and heuristic “Game” approach. The numerical experiments for proposed algorithms validation are conducted on the basis of actual data of Zabaykalsky Krai development. Multiple input parameters of the model vary in these experiments. Finally, we present a brief analysis of the obtained solutions to the stochastic linear programming problems with Boolean variables.

The aim of this paper is to derive a method for solving a stochastic linear programming problem with Cauchy distribution. Assuming that the coefficients are distributed as Cauchy random variables, the stochastic linear programming is converted to a deterministic non-linear programming problem by a suitable transformation. Then an algorithm can be used to solve the resulting deterministic problem .A numerical example can be considered to illustrate the above methodology.

The row pivoting method for linear programming

Managing the limited resources of money, time and space poses a real problem in the livestock business in general and the poultry sector in particular. The stochastic linear programming with recourse will permit the formulation of a mathematical model that could easily be solved in order to attain the objective of maximizing profit but this will be hindered by the presence of some parameters like demand and supply which have no predetermined probability distributions. In an attempt to address the problem of unavailable probability distribution functions, this research is aimed at proposing a robust linear programming model which can handle problems and others in similar circumstances with the need of probability distributions.The robust model thus constructed is based on a modification of the stochastic model by Soyster. An application of this model on a real life data produced results showing an increase in profit made by a local poultry farmer from 241,485 FCFA to 362,580FCFA representing an increase in profit of more than 50% in over that obtained when using the ordinary Linear Programming Technique. The belief therefore is that, if models like this are implemented, not only would the livelihood of the poultry farmers be improved, but it will go a long way to better the economy and satisfy the ever increasing need of poultry products by the communities. Key words: Maximization, livestock, stochastic, robust, linear programming, optimization. &nbsp

Problems that reduce to consistency or inconsistency of systems of linear equations or inequalities arise in many divisions of theoretical informatics. The examples are problems in linear programming, machine learning, multicriteria optimization, etc. There exist different stability measures for the property of consistency or inconsistency, and different information constituents are possible (all the input parameters, the coefficient matrix, the vector of constraints). In this paper, variations of all parameters are examined in combination with an additional constraint important in applications, namely, the nonnegativity of feasible points.

Chapter Three - Introduction to Stochastic Programming