A new sufficient condition for most rapid approach paths (Q1079175): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Most Rapid Approach Paths in Accumulation Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nearest feasible paths in optimization control problems: Theory, examples, and counterexamples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3959003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal capital policy, the cost of capital, and myopic decision rules / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4139908 / rank | |||
Normal rank | |||
Latest revision as of 15:13, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new sufficient condition for most rapid approach paths |
scientific article |
Statements
A new sufficient condition for most rapid approach paths (English)
0 references
1987
0 references
We show that in some previous literature the most rapid approach theorems are incomplete. This is proved by providing a counterexample. We also introduce an additional condition that guarantees the optimality of the most rapid approach path.
0 references
counterexample
0 references
most rapid approach path
0 references
Green's theorem
0 references
infinite- horizon problems
0 references
0 references
