Displaying similar documents to “The online specialization problem.”

Stochastic bottleneck transportation problem with flexible supply and demand quantity

Yue Ge, Hiroaki Ishii (2011)

Kybernetika

Similarity:

We consider the following bottleneck transportation problem with both random and fuzzy factors. There exist m supply points with flexible supply quantity and n demand points with flexible demand quantity. For each supply-demand point pair, the transportation time is an independent positive random variable according to a normal distribution. Satisfaction degrees about the supply and demand quantity are attached to each supply and each demand point, respectively. They are denoted by membership...

A branch&bound algorithm for solving one-dimensional cutting stock problems exactly

Guntram Scheithauer, Johannes Terno (1995)

Applicationes Mathematicae

Similarity:

Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.

A consumption-investment problem modelled as a discounted Markov decision process

Hugo Cruz-Suárez, Raúl Montes-de-Oca, Gabriel Zacarías (2011)

Kybernetika

Similarity:

In this paper a problem of consumption and investment is presented as a model of a discounted Markov decision process with discrete-time. In this problem, it is assumed that the wealth is affected by a production function. This assumption gives the investor a chance to increase his wealth before the investment. For the solution of the problem there is established a suitable version of the Euler Equation (EE) which characterizes its optimal policy completely, that is, there are provided...

Average cost Markov control processes with weighted norms: value iteration

Evgueni Gordienko, Onésimo Hernández-Lerma (1995)

Applicationes Mathematicae

Similarity:

This paper shows the convergence of the value iteration (or successive approximations) algorithm for average cost (AC) Markov control processes on Borel spaces, with possibly unbounded cost, under appropriate hypotheses on weighted norms for the cost function and the transition law. It is also shown that the aforementioned convergence implies strong forms of AC-optimality and the existence of forecast horizons.