A conception of optimality for algorithms and its application to the optimal search for a minimum
A. Adamski, A. Korytowski, W. Mitkowski (1977)
Applicationes Mathematicae
Similarity:
A. Adamski, A. Korytowski, W. Mitkowski (1977)
Applicationes Mathematicae
Similarity:
Frisch, Uriel, Sobolevskii, A. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
Petr Dostál (2006)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
L. Gajek, P. Miś, J. Słowińska (2007)
Applicationes Mathematicae
Similarity:
Optimal arrangement of a stream of insurance premiums for a multiperiod insurance policy is considered. In order to satisfy solvency requirements we assume that a weak Axiom of Solvency is satisfied. Then two optimization problems are solved: finding a stream of net premiums that approximates optimally 1) future claims, or 2) "anticipating premiums". It is shown that the resulting optimal streams of premiums enable differentiating between policyholders much more quickly than one-period...
Marek Kubale, Krzysztof Ocetkiewicz (2009)
Control and Cybernetics
Similarity:
K. Szajowski (1982)
Applicationes Mathematicae
Similarity:
Dariusz Socha (2014)
Applicationes Mathematicae
Similarity:
An optimal dividend problem is studied consisting in maximisation of expected discounted dividend payments until ruin time. A solution of this problem for constant premium d and exponentially distributed claims is presented. It is shown that an optimal policy is a barrier policy. Moreover, an analytic way to solve this problem is sketched.
Ilija Nikolić (2007)
The Yugoslav Journal of Operations Research
Similarity:
Lee, W.R., Wang, S., Teo, K.L. (1999)
Mathematical Problems in Engineering
Similarity:
Kumar, Ramesh C., Naqib, Fadle M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Edward W. Packel (1988)
Banach Center Publications
Similarity:
Diptesh Ghosh, Gerard Sierksma (2003)
Applicationes Mathematicae
Similarity:
This paper studies the complexity of sensitivity analysis for optimal and ε-optimal solutions to general 0-1 combinatorial optimization problems with min-max objectives. Van Hoesel and Wagelmans [9] have studied the complexity of sensitivity analysis of optimal and ε-optimal solutions to min-sum problems, and Ramaswamy et al. [17] the complexity of sensitivity analysis of optimal solutions to min-max problems. We show that under some mild assumptions the sensitivity analysis of ε-optimal...