Multicut L-Shaped Algorithm for Stochastic Convex Programming with Fuzzy Probability Distribution
نویسندگان
چکیده
منابع مشابه
A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
This paper considers the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). The MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand to minimize the total cost generated during the planning horizon. The problem is formulated as a two-stage stochastic programming model, in which the firs...
متن کاملAn Extension of the Multicut L-Shaped Method INEN 698 - Large-Scale Stochastic Optimization Semester project
The L-shaped method allows to solve large scale stochastic problems that cannot be solved directly. Each major iteration method solves all scenario subproblems and generate a single optimality or feasibility cut to the master problem by aggregating all the cuts obtained from the subproblems. This causes an ”information loss” and results in a large number of major iterations. The multicut L-shap...
متن کاملA Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However,...
متن کاملStochastic Programming with Probability Constraints
In this work we study optimization problems subject to a failure constraint. This constraint is expressed in terms of a condition that causes failure, representing a physical or technical breakdown. We formulate the problem in terms of a probability constraint, where the level of “confidence” is a modelling parameter and has the interpretation that the probability of failure should not exceed t...
متن کاملThe KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Applied Sciences
سال: 2012
ISSN: 2165-3917,2165-3925
DOI: 10.4236/ojapps.2012.24b050