Search
Now showing items 31-40 of 69
Stochastic Surface Models for Commodity Futures: A 2D Kalman Filter Approach
(2011-09)
We propose a two-dimensional Kalman filter approach that, additional to the information contained in futures prices evolution over time, makes use of information contained in the term structure of commodity futures along ...
A time varying coefficient model for panel data: Foreign Direct Investment in European OECD countries
(2007-04)
The present article reexamines some of the issues regarding the Knowledge-Capital Model that encompasses both horizontal and vertical Foreign Direct Investment described in detail in the literature. The empirical support ...
Lagrangean decomposition for large-scale two-stage stochastic mixed 0-1 problems
(2010-07)
In this paper we study solution methods for solving the dual problem corresponding to the Lagrangean Decomposition of two stage stochastic mixed 0-1 models. We represent the two stage stochastic mixed 0-1 problem by a ...
Commitment Power in a Non-Stationary Durable-Good Market
(2001-05)
This paper derives and evaluates the decisions of a durable good monopolist in a context where demand for the services of the durable good changes over time. It shows that, if the size of the market decreases over time, ...
A two-stage stochastic integer programming approach
(2005)
We present an algorithmic approach for solving two-stage stochastic mixed 0-1 problems. The first stage constraints of the Deterministic Equivalent Model have 0--1 variables and continuous variables. The approach uses the ...
Some experiments on solving multistage stochastic mixed 0-1 programs with time stochastic dominance constraints
(2015)
In this work we extend to the multistage case two recent risk averse measures for two-stage stochastic
programs based on first- and second-order stochastic dominance constraints induced by mixed-integer linear
recourse. ...
On downloading and using COIN-OR for solving linear/integer optimization problems
(2010)
The aim of this technical report is to present some detailed explanations in order to help to use the open source software for optimization COIN-OR. In particular, we describe how to download, install and use the corresponding ...
A note on the implementation of the BFC-MSMIP algorithm in C++ by using COIN-OR as an optimization engine
(2010)
The aim of this technical report is to present some detailed explanations in order to help to understand and use the algorithm Branch and Fix Coordination for solving MultiStage Mixed Integer Problems (BFC- MSMIP). We have ...
A parallelizable algorithmic framework for solving large scale multi-stage stochastic mixed 0-1 problems under uncertainty
(2011-02)
In this paper we present a parallelizable scheme of the Branch-and-Fix Coordination algorithm for solving medium and large scale multi-stage mixed 0-1 optimization problems under uncertainty. The uncertainty is represented ...
On solving two stage stochastic linear problems by using a new approach, Cluster Benders Decomposition
(2010-11)
The optimization of stochastic linear problems, via scenario analysis, based on Benders decomposition requires to appending feasibility and/or optimality cuts to the master problem until the iterative procedure reaches the ...