✦ LIBER ✦

Absolute optimal solution for a compact and convex game

✍ Scribed by Nessah, Rabia; Tazdaı¨t, Tarik

Book ID: 119234554
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 289 KB
Volume: 224
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.08.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A constrained egalitarian solution for c

A constrained egalitarian solution for convex multi-choice games

✍ Branzei, R.; Llorca, N.; Sánchez-Soriano, J.; Tijs, S. 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 386 KB

Characterizations of the nonemptiness an

Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems

✍ X. X. Huang, J. C. Yao 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 219 KB

Absolutely cooperative solution for a li

Absolutely cooperative solution for a linear, multiplayer differential game

✍ G. Basile; T. L. Vincent 📂 Article 📅 1970 🏛 Springer 🌐 English ⚖ 324 KB

Characterizations of the Nonemptiness an

Characterizations of the Nonemptiness and Compactness of Solution Sets in Convex Vector Optimization

✍ S. Deng 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 320 KB

A nonisolated optimal solution for speci

A nonisolated optimal solution for special reverse convex programming problems

✍ Pei-Ping Shen; Yong-Qiang Chen; Yuan Ma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 696 KB

In this paper, an efficient algorithm is proposed for globally solving special reverse convex programming problems with more than one reverse convex constraints. The proposed algorithm provides a nonisolated global optimal solution which is also stable under small perturbations of the constraints, a

Characterization of the Nonemptiness and

Characterization of the Nonemptiness and Compactness of Solution Sets in Convex and Nonconvex Vector Optimization

✍ F. Flores-Bazán; C. Vera 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 252 KB