Sufficient conditions for optimization
✍ Scribed by N.N Krasovskii
- Publisher
- Elsevier Science
- Year
- 1959
- Tongue
- English
- Weight
- 264 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0021-8928
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this paper we derive sufficient conditions for optimal control problems with mixed control and state constraints by applying a dual approach to the dynamic programming. These conditions guarantee that a relative minimum is achieved. We seek an optimal pair in the class of those admis
In this paper the various definitions of nonsmooth invex functions are gathered in a general scheme by means of the concept of K-directional derivative. Characterizations of nonsmooth K-invexity are derived as well as results concerning constrained optimization without any assumption of convexity of
## Abstract For a connected graph the restricted edge‐connectivity λ′(__G__) is defined as the minimum cardinality of an edge‐cut over all edge‐cuts __S__ such that there are no isolated vertices in __G__–__S__. A graph __G__ is said to be λ′‐optimal if λ′(__G__) = ξ(__G__), where ξ(__G__) is the m