共查询到20条相似文献,搜索用时 421 毫秒
1.
Stochastic dominance relations are well studied in statistics, decision theory and economics. Recently, there has been significant
interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic
optimization models involving second order stochastic dominance constraints can be solved by linear programming. However,
problems involving first order stochastic dominance constraints are potentially hard due to the non-convexity of the associated
feasible regions. In this paper we consider a mixed 0–1 linear programming formulation of a discrete first order constrained
optimization model and present a relaxation based on second order constraints. We derive some valid inequalities and restrictions
by employing the probabilistic structure of the problem. We also generate cuts that are valid inequalities for the disjunctive
relaxations arising from the underlying combinatorial structure of the problem by applying the lift-and-project procedure.
We describe three heuristic algorithms to construct feasible solutions, based on conditional second order constraints, variable
fixing, and conditional value at risk. Finally, we present numerical results for several instances of a real world portfolio
optimization problem.
This research was supported by the NSF awards DMS-0603728 and DMI-0354678. 相似文献
2.
Second-order stochastic dominance constrained portfolio optimization: Theory and computational tests
Markku Kallio Nasim Dehghan Hardoroudi 《European Journal of Operational Research》2018,264(2):675-685
Due to the definition of second-order stochastic dominance (SSD) in terms of utility theory, portfolio optimization with SSD constraints is of major practical interest. We contribute to the field in two ways: first, we present a self-contained theory with some new results and new proofs of known results; second, we perform a set of tests for computational efficiency. We provide new and simple arguments for the formulation of SSD constraints in a mathematical programming framework. For many individuals, an SSD constraint may seem too severe wherefore various relaxations (ASSD), have been proposed. We introduce yet another relaxation, directional SSD, where a candidate portfolio is admissible if a step from the benchmark in the direction of the candidate yields a dominating portfolio. Optimal step size depends on individual preferences reflected by the objective function. We compare computational efficiency of seven approaches for SD constrained portfolio problems, including SSD and ASSD constrained cases. 相似文献
3.
Opportunities to make sequential decisions and adjust activities as a season progresses and more information becomes available characterise the farm management process. In this paper, we present a discrete stochastic two-stage utility-efficient programming model of organic dairy farms, which includes risk aversion in the decision maker’s objective function as well as both embedded risk (stochastic programming with recourse) and non-embedded risk (stochastic programming without recourse). Historical farm accountancy data and subjective judgements were combined to assess the nature of the uncertainty that affects the possible consequences of the decisions. The programming model was used within a stochastic dominance framework to examine optimal strategies in organic dairy systems in Norway. 相似文献
4.
《Operations Research Letters》2020,48(4):505-512
We propose a class of partially observable multistage stochastic programs and describe an algorithm for solving this class of problems. We provide a Bayesian update of a belief-state vector, extend the stochastic programming formulation to incorporate the belief state, and characterize saddle-function properties of the corresponding cost-to-go function. Our algorithm is a derivative of the stochastic dual dynamic programming method. 相似文献
5.
Fouad Ben Abdelaziz 《European Journal of Operational Research》2012,216(1):1-16
We survey in this paper various solution approaches for multiobjective stochastic problems where random variables can be in both objectives and constraints parameters. Once a problem requires a stochastic formulation, a first step consists in transforming the problem into its deterministic formulation. We propose to classify and evaluate such transformations with regards to the many proposed concepts of efficiency. The paper addresses also some applications of the multiobjective stochastic programming models. 相似文献
6.
Vyacheslav V. Kalashnikov Gerardo A. Pérez-Valdés Asgeir Tomasgard Nataliya I. Kalashnykova 《European Journal of Operational Research》2010
A stochastic formulation of the natural gas cash-out problem is given in a form of a bilevel multi-stage stochastic programming model with recourse. After reducing the original formulation to a bilevel linear problem, a stochastic scenario tree is defined by its node events, and time series forecasting is used to produce stochastic values for data of natural gas price and demand. Numerical experiments were run to compare the stochastic solution with the perfect information solution and the expected value solutions. 相似文献
7.
This paper analyzes the dual formulation of Post’s [Post, T., 2003. Empirical tests for stochastic dominance efficiency. Journal of Finance 58, 1905–1932] test for second-order stochastic dominance (SSD) efficiency of a given investment portfolio relative to all possible portfolios formed from set of assets. In contrast to the earlier work, we (1) provide a direct proof for the dual that does not rely on expected utility theory, (2) adhere to the original definition of SSD, (3) phrase in terms of a general polyhedral portfolio possibilities set and (4) construct a SSD dominating benchmark portfolio from the optimal solution. To illustrate the dual SSD test, we apply the test to analyze the effect of short-selling restrictions on the profitability of momentum investment strategies. 相似文献
8.
Multiobjective approach is the common way of generalization single-criterion dynamic programming models. Another way is to consider partially ordered criteria structures. That approach is rather rare. The aim of the paper is to present such a model. Generalization of Bellman’s principle of optimality is employed to create a forward procedure to find the set of all maximal elements. As this set is usual large, the second problem under consideration is to find its subsets. To reduce the number of solutions presented to decision maker we propose to apply a family of narrowing relations. That approach is similar to scalarization in multiobjective programming. Ordered structures of random variables based on mean–variance, stochastic dominance and inverse stochastic dominance are considered. Numerical illustration is given at the end of the paper. 相似文献
9.
In this work we present a global optimization algorithm for solving a class of large-scale nonconvex optimization models that
have a decomposable structure. Such models, which are very expensive to solve to global optimality, are frequently encountered
in two-stage stochastic programming problems, engineering design, and also in planning and scheduling. A generic formulation
and reformulation of the decomposable models is given. We propose a specialized deterministic branch-and-cut algorithm to
solve these models to global optimality, wherein bounds on the global optimum are obtained by solving convex relaxations of
these models with certain cuts added to them in order to tighten the relaxations. These cuts are based on the solutions of
the sub-problems obtained by applying Lagrangean decomposition to the original nonconvex model. Numerical examples are presented
to illustrate the effectiveness of the proposed method compared to available commercial global optimization solvers that are
based on branch and bound methods. 相似文献
10.
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models
- studied in mathematical finance for several decades - have attracted attention in stochastic programming. We consider Conditional
Value-at-Risk as risk measure in the framework of two-stage stochastic integer programming. The paper addresses structure,
stability, and algorithms for this class of models. In particular, we study continuity properties of the objective function,
both with respect to the first-stage decisions and the integrating probability measure. Further, we present an explicit mixed-integer
linear programming formulation of the problem when the probability distribution is discrete and finite. Finally, a solution
algorithm based on Lagrangean relaxation of nonanticipativity is proposed.
Received: April, 2004 相似文献
11.
Ersin Krpeolu Hande Yaman M. Selim Aktürk 《European Journal of Operational Research》2011,213(1):166-179
Master Production Schedules (MPS) are widely used in industry, especially within Enterprise Resource Planning (ERP) software. The classical approach for generating MPS assumes infinite capacity, fixed processing times, and a single scenario for demand forecasts. In this paper, we question these assumptions and consider a problem with finite capacity, controllable processing times, and several demand scenarios instead of just one. We use a multi-stage stochastic programming approach in order to come up with the maximum expected profit given the demand scenarios. Controllable processing times enlarge the solution space so that the limited capacity of production resources are utilized more effectively. We propose an effective formulation that enables an extensive computational study. Our computational results clearly indicate that instead of relying on relatively simple heuristic methods, multi-stage stochastic programming can be used effectively to solve MPS problems, and that controllability increases the performance of multi-stage solutions. 相似文献
12.
Zaid Chalabi David Epstein Claire McKenna Karl Claxton 《European Journal of Operational Research》2008
A two-stage stochastic mathematical programming formulation has been developed to optimally allocate resources within and between healthcare programmes when there is an exogenous budget and the parameters of the healthcare models are variable and uncertain. This formulation solves the optimal resource allocation problem and calculates the expected value of acquiring additional information to resolve the uncertainties within the allocation. It is shown that the proposed formulation has several advantages over the chance constrained and robust mathematical programming methods. 相似文献
13.
David P. Morton 《Annals of Operations Research》1996,64(1):211-235
Handling uncertainty in natural inflow is an important part of a hydroelectric scheduling model. In a stochastic programming formulation, natural inflow may be modeled as a random vector with known distribution, but the size of the resulting mathematical program can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We develop an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of stochastic hydroelectric scheduling problems. 相似文献
14.
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper
presents a first computational study of a disjunctive cutting plane method for stochastic mixed 0-1 programs that uses lift-and-project
cuts based on the extensive form of the two-stage SMIP problem. An extension of the method based on where the data uncertainty
appears in the problem is made, and it is shown how a valid inequality derived for one scenario can be made valid for other
scenarios, potentially reducing solution time. Computational results amply demonstrate the effectiveness of disjunctive cuts
in solving several large-scale problem instances from the literature. The results are compared to the computational results
of disjunctive cuts based on the subproblem space of the formulation and it is shown that the two methods are equivalently
effective on the test instances. 相似文献
15.
两阶段随机线性规划的费用型鲁棒模型 总被引:2,自引:0,他引:2
Vladmiron和Zenios曾引进了限制补偿的概念,给出了关于具有补偿的两阶段随机线性规划的鲁棒优化的新的表述。为适应决策者对补偿在技术操作上的稳定性与经费预算上的稳定性的需求,我们提出了费用型鲁棒模型以及混合型鲁棒模型,并转化为序列修正的线性规划的求解问题. 相似文献
16.
The treasurer of a bank is responsible for the cash management of several banking activities. In this work, we focus on two of them: cash management in automatic teller machines (ATMs), and in the compensation of credit card transactions. In both cases a decision must be taken according to a future customers demand, which is uncertain. From historical data we can obtain a discrete probability distribution of this demand, which allows the application of stochastic programming techniques. We present stochastic programming models for each problem. Two short-term and one mid-term models are presented for ATMs. The short-term model with fixed costs results in an integer problem which is solved by a fast (i.e. linear running time) algorithm. The short-term model with fixed and staircase costs is solved through its MILP equivalent deterministic formulation. The mid-term model with fixed and staircase costs gives rise to a multi-stage stochastic problem, which is also solved by its MILP deterministic equivalent. The model for compensation of credit card transactions results in a closed form solution. The optimal solutions of those models are the best decisions to be taken by the bank, and provide the basis for a decision support system. 相似文献
17.
In this paper, we consider the formulation and heuristic algorithm for the capacity allocation problem with random demands in the rail container transportation. The problem is formulated as the stochastic integer programming model taking into account matches in supply and demand of rail container transportation. A heuristic algorithm for the stochastic integer programming model is proposed. The solution to the model is found by maximizing the expected total profit over the possible control decisions under the uncertainty of demands. Finally, we give numerical experiments to demonstrate the efficiency of the heuristic algorithm. 相似文献
18.
陈志平 《高等学校计算数学学报(英文版)》2003,12(2)
A new deterministic formulation, called the conditional expectation formulation, is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations. We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size, nonzero elements and solution time by solving some typi 相似文献
19.
We discuss methods for the solution of a multi-stage stochastic programming formulation for the resource-constrained scheduling of clinical trials in the pharmaceutical research and development pipeline. First, we present a number of theoretical properties to reduce the size and improve the tightness of the formulation, focusing primarily on non-anticipativity constraints. Second, we develop a novel branch and cut algorithm where necessary non-anticipativity constraints that are unlikely to be active are removed from the initial formulation and only added if they are violated within the search tree. We improve the performance of our algorithm by combining different node selection strategies and exploring different approaches to constraint violation checking. 相似文献
20.
The cutting stock problem (CSP) is one of the most fascinating problems in operations research. The problem aims at determining the optimal plan to cut a number of parts of various length from an inventory of standard-size material so to satisfy the customers demands. The deterministic CSP ignores the uncertain nature of the demands thus typically providing recommendations that may result in overproduction or in profit loss. This paper proposes a stochastic version of the CSP which explicitly takes into account uncertainty. Using a scenario-based approach, we develop a two-stage stochastic programming formulation. The highly non-convex nature of the model together with its huge size prevent the application of standard software. We use a solution approach designed to exploit the specific problem structure. Encouraging preliminary computational results are provided. 相似文献