DNSS points, also known as Skiba points, arise in optimal control problems that exhibit multiple optimal solutions. A DNSS point
−
named alphabetically after Deckert and Nishimura, Sethi, and Skiba
−
is an indifference point in an optimal control problem such that starting from such a point, the problem has more than one different optimal solutions. A good discussion of such points can be found in Grass et al.
Of particular interest here are discounted infinite horizon optimal control problems that are autonomous. These problems can be formulated as
max
u
(
t
)
∈
Ω
∫
0
∞
e
−
ρ
t
φ
(
x
(
t
)
,
u
(
t
)
)
d
t
s.t.
x
˙
(
t
)
=
f
(
x
(
t
)
,
u
(
t
)
)
,
x
(
0
)
=
x
0
,
where
ρ
>
0
is the discount rate,
x
(
t
)
and
u
(
t
)
are the state and control variables, respectively, at time
t
, functions
φ
and
f
are assumed to be continuously differentiable with respect to their arguments and they do not depend explicitly on time
t
, and
Ω
is the set of feasible controls and it also is explicitly independent of time
t
. Furthermore, it is assumed that the integral converges for any admissible solution
(
x
(
.
)
,
u
(
.
)
)
. In such a problem with one-dimensional state variable
x
, the initial state
x
0
is called a DNSS point if the system starting from it exhibits multiple optimal solutions or equilibria. Thus, at least in the neighborhood of
x
0
, the system moves to one equilibrium for
x
>
x
0
and to another for
x
<
x
0
. In this sense,
x
0
is an indifference point from which the system could move to either of the two equilibria.
For two-dimensional optimal control problems, Grass et al. and Zeiler et al. present examples that exhibit DNSS curves.
Some references on the application of DNSS points are Caulkins et al. and Zeiler et al.
Suresh P. Sethi identified such indifference points for the first time in 1977. Further, Skiba, Sethi, and Deckert and Nishimura explored these indifference points in economic models. The term DNSS (Deckert, Nishimura, Sethi, Skiba) points, introduced by Grass et al., recognizes (alphabetically) the contributions of these authors.
These indifference points have been referred to earlier as Skiba points or DNS points in the literature.
A simple problem exhibiting this behavior is given by
φ
(
x
,
u
)
=
x
u
,
f
(
x
,
u
)
=
−
x
+
u
,
and
Ω
=
[
−
1
,
1
]
. It is shown in Grass et al. that
x
0
=
0
is a DNSS point for this problem because the optimal path
x
(
t
)
can be either
(
1
−
e
−
t
)
or
(
−
1
+
e
−
t
)
. Note that for
x
0
<
0
, the optimal path is
x
(
t
)
=
−
1
+
e
−
t
(
x
0
+
1
)
and for
x
0
>
0
, the optimal path is
x
(
t
)
=
1
+
e
−
t
(
x
0
−
1
)
.
For further details and extensions, the reader is referred to Grass et al.
