Displaying similar documents to “Necessary conditions of optimality in neutral type optimal problems with non-fixed initial moment.”

Entry-exit decisions with implementation delay under uncertainty

Yong-Chao Zhang (2018)

Applications of Mathematics

Similarity:

We employ a natural method from the perspective of the optimal stopping theory to analyze entry-exit decisions with implementation delay of a project, and provide closed expressions for optimal entry decision times, optimal exit decision times, and the maximal expected present value of the project. The results in conventional research were obtained under the restriction that the sum of the entry cost and exit cost is nonnegative. In practice, we may meet cases when this sum is negative,...

On the Optimal Control of a Class of Time-Delay System

L. Boudjenah, M.F. Khelfi (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

In this work we study the optimal control problem for a class of nonlinear time-delay systems via paratingent equation with delayed argument. We use an equivalence theorem between solutions of differential inclusions with time-delay and solutions of paratingent equations with delayed argument. We study the problem of optimal control which minimizes a certain cost function. To show the existence of optimal control, we use the main topological...

Optimal streams of premiums in multiperiod credibility models

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...

On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems

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...