✦ LIBER ✦

Convex duality and the Skorokhod Problem. II

✍ Scribed by Paul Dupuis; Kavita Ramanan

Publisher: Springer
Year: 1999
Tongue: English
Weight: 240 KB
Volume: 115
Category: Article
ISSN: 1432-2064
DOI: 10.1007/s004400050270

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex duality and the Skorokhod Problem

Convex duality and the Skorokhod Problem. I

✍ Paul Dupuis; Kavita Ramanan 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 249 KB

Multiobjective duality for convex-linear

Multiobjective duality for convex-linear problems II

✍ Gert Wanka; Radu-Ioan Boţ 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 133 KB

Duality relations for the convex optinal

Duality relations for the convex optinal control problem

✍ A.A. Levikov 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 418 KB

The duality principle in problems of con

The duality principle in problems of convex programming

✍ B.N. Pshenichnyi 📂 Article 📅 1965 🏛 Elsevier Science ⚖ 562 KB

The duality of certain non-convex extrem

The duality of certain non-convex extremal problems

✍ V.N. Solov'yev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 352 KB

A simplicial branch and duality bound al

A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem

✍ Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 601 KB

This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh