Page 1 Next

Displaying 1 – 20 of 85

Showing per page

Identification of optimal policies in Markov decision processes

Karel Sladký (2010)

Kybernetika

In this note we focus attention on identifying optimal policies and on elimination suboptimal policies minimizing optimality criteria in discrete-time Markov decision processes with finite state space and compact action set. We present unified approach to value iteration algorithms that enables to generate lower and upper bounds on optimal values, as well as on the current policy. Using the modified value iterations it is possible to eliminate suboptimal actions and to identify an optimal policy...

Implementación de un algoritmo primal-dual de orden superior mediante el uso de un método predictor-corrector para programación lineal.

Jordi Castro (1998)

Qüestiió

Se presenta una implementación de un algoritmo primal-dual de punto interior para la solución de problemas lineales. El algoritmo difiere de otros ya existentes (como el implementado en el sistema LoQo) en el hecho de que soluciona las denominadas "ecuaciones normales en forma primal" (LoQo soluciona el denominado "sistema aumentado") y en que realiza una clara distinción entre variables acotadas superior e inferiormente, y aquéllas sólo acotadas inferiormente. La eficiencia de la implementación...

Implicit constitutive solution scheme for Mohr-Coulomb plasticity

Sysala, Stanislav, Čermák, Martin (2017)

Programs and Algorithms of Numerical Mathematics

This contribution summarizes an implicit constitutive solution scheme of the elastoplastic problem containing the Mohr-Coulomb yield criterion, a nonassociative flow rule, and a nonlinear isotropic hardening. The presented scheme builds upon the subdifferential formulation of the flow rule leading to several improvements. Mainly, it is possible to detect a position of the unknown stress tensor on the Mohr-Coulomb pyramid without blind guesswork. Further, a simplified construction of the consistent...

Improved approximation of the general soft-capacitated facility location problem

Laurent Alfandari (2007)

RAIRO - Operations Research

The soft-capacitated facility location problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a fully polynomial-time approximation...

Currently displaying 1 – 20 of 85

Page 1 Next