Stochastic programs inevitably get huge if they are to model real life problems accurately. Nowadays only massive parallel machines can solve them but at a cost few decision makers can afford. We report hereon a deterministic equivalent linear programming model of 1,111,112 constraints and...

This paper solves the pure consumption Grossman model numerically following dynamic programming method, and undertakes sensitivity analysis of the optimal length of life. This is the first analysis that treats the determination of optimal length of life explicitly with numerical analysis.

This paper solves the pure consumption Grossman model numerically following dynamic programming method, and undertakes sensitivity analysis of the optimal length of life. This is the first analysis that treats the determination of optimal length of life explicitly with numerical analysis.

We provide a monotonic transformation of an initial diffusion with a level-dependent diffusion parameter that yields a second, deterministic parameter process. Altering the diffusion parameter while maintaining the original Brownian motion at the expense of the drift can be viewed as a...

We present a new result on the asymptotic behavior of non-autonomous subgradient evolution equations.

In this paper we give an overview of the mostimportant characteristics of advanced implementations of interior point methods.

Galois connections (or residuated mapping) are of growing interest in various domains related with or relevant from Classification. Among their many uses, we select some topics related with modelization and aggregation of dissimilarities and conceptual classification. We partially revist them in...

In this paper we present several "infeasible-start" path-following and potential-reduction primal-dual interior-point methods for non-linear conic problems. These methods try to find a recession direction of the feasible set of a self-dual homogeneous primal-dual problem.

This paper addresses the issues involved with an interior point-based decomposition applied to the solution of linear programs with a block-angular structure. Unlike classicla decomposition schemes that use the simplex method to solve subproblems, the approach presented in this paper employs a...

In this note we address the problem of constructing dominating sets for problems whose objective is a componentwise nondecreasing function of (possibly an infinite number of) convex functions, and we show how to obtain a convex dominating set in terms of dominating sets of simpler problems.