Displaying similar documents to “Time Petri nets state space reduction using dynamic programming”

Chance constrained problems: penalty reformulation and performance of sample approximation technique

Martin Branda (2012)

Kybernetika

Similarity:

We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6,11]. The obtained problems with penalties and with a fixed set of feasible solutions are simpler to solve and analyze then the chance constrained programs. We discuss solving...

Shaking compact sets.

Campi, Stefano, Colesanti, Andrea, Gronchi, Paolo (2001)

Beiträge zur Algebra und Geometrie

Similarity:

An unbounded Berge's minimum theorem with applications to discounted Markov decision processes

Raúl Montes-de-Oca, Enrique Lemus-Rodríguez (2012)

Kybernetika

Similarity:

This paper deals with a certain class of unbounded optimization problems. The optimization problems taken into account depend on a parameter. Firstly, there are established conditions which permit to guarantee the continuity with respect to the parameter of the minimum of the optimization problems under consideration, and the upper semicontinuity of the multifunction which applies each parameter into its set of minimizers. Besides, with the additional condition of uniqueness of the minimizer,...