✦ LIBER ✦

A new optimality criterion for discrete dynamic programming

✍ Scribed by Hisashi Mine; Yoshio Tabata

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 443 KB
Volume: 37
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(72)90261-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimality criterion method for dynam

An optimality criterion method for dynamic optimization of structures

✍ Edward A. Sadek 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 644 KB

A sufficient optimality criterion in con

A sufficient optimality criterion in continuous time programming for generalized convex functions

✍ Chanchal Singh 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Dynamic programming and maximum principl

Dynamic programming and maximum principle for discrete Goursat systems

✍ S.A. Belbas 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 828 KB

A mechanical dynamic programming algorit

A mechanical dynamic programming algorithm for structure optimization

✍ Eckart Schnack; Uwe Spörl 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 992 KB

Optimality and computational feasibility

Optimality and computational feasibility in transient control: Part I. A modified criterion for optimality

✍ W. O. Paradis; D. D. Perlmutter 📂 Article 📅 1966 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 779 KB

Optimality conditions for convex semi-in

Optimality conditions for convex semi-infinite programming problems

✍ A. Ben-Tal; L. Kerzner; S. Zlobec 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories