✦ LIBER ✦

The associated maximization problem for separable games

✍ Scribed by L. C. Westphal; A. R. Stubberud

Publisher: Springer-Verlag
Year: 1973
Tongue: English
Weight: 282 KB
Volume: 5
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580139

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An associated maximization problem for t

An associated maximization problem for two-person nonzero-sum separable games

✍ L. C. Westphal 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 127 KB

Algorithms for the vector maximization p

Algorithms for the vector maximization problem

✍ Johan Philip 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 750 KB

A memetic algorithm for the cyclic antib

A memetic algorithm for the cyclic antibandwidth maximization problem

✍ Richa Bansal; Kamal Srivastava 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 876 KB

The convergence problem for differential

The convergence problem for differential games

✍ Wendell H Fleming 📂 Article 📅 1961 🏛 Elsevier Science 🌐 English ⚖ 688 KB

The “largest element first” heuristic fo

The “largest element first” heuristic for the maximization assignment problem

✍ D.J. White 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The maximal range problem for a quasidis

The maximal range problem for a quasidisk

✍ Vladimir Andrievskii 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Let GCC and DCC be simply connected domains such that 0AG-D: Denote by P n ; nAN :¼ f1; 2; yg; the set of all complex polynomials of degree at most n: Let P n ðG; DÞ :¼ fpAP n : pð0Þ ¼ 0; pðGÞCDg: Our main purpose is to find how large, i.e., how close to D; the ''maximal polynomial range'' D n ðGÞ