✦ LIBER ✦

Calibration and convex programming: two approaches to one problem

✍ Scribed by László Mihályffy

Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 157 KB
Volume: 19
Category: Article
ISSN: 1435-246X
DOI: 10.1007/s10100-010-0147-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear programming approaches to the con

Linear programming approaches to the convex hull problem in Rm

✍ P.M. Pardalos; Y. Li; W.W. Hager 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 397 KB

One approach to solving problems of dyna

One approach to solving problems of dynamic convex programming

✍ Yu. P. Ivanilov; Yu. E. Malashenko 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 672 KB

On the convex programming approach to li

On the convex programming approach to linear programming

✍ J.R. Rajasekera; S.C. Fang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Another approach to multiobjective progr

Another approach to multiobjective programming problems withF-convex functions

✍ Sanming Liu; Enmin Feng 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 158 KB

Dynamic programming approaches to the mu

Dynamic programming approaches to the multiple criteria knapsack problem

✍ Kathrin Klamroth; Margaret M. Wiecek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

Convex programming, variational inequali

Convex programming, variational inequalities, and applications to the traffic equilibrium problem

✍ Antonino Maugeri 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 711 KB