✦ LIBER ✦

Dual of the maximum cost minimization problem

✍ Scribed by A. A. Lazarev

Publisher: Springer US
Year: 1989
Tongue: English
Weight: 167 KB
Volume: 44
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01095176

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimal cost maximum matching of a g

The minimal cost maximum matching of a graph

✍ A. O. De Maio; C. A. Roveda 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 815 KB

The minimal cost flow problem with conve

The minimal cost flow problem with convex costs

✍ V. V. Menon 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

The minimal average cost flow problem

✍ Y.L. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 600 KB

The minimal cost maximum matching of a g

The minimal cost maximum matching of a graph (supplementary remarks)

✍ H. Müller-Merbach 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 141 KB

Matrix scaling, entropy minimization, an

Matrix scaling, entropy minimization, and conjugate duality (II): The dual problem

✍ Michael H. Schneider 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 962 KB

The death of cost-minimization analysis?

✍ Andrew H. Briggs; Bernie J. O'Brien 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract Four different types of evaluation methods, cost‐benefit analysis (CBA), cost‐utility analysis (CUA), cost‐effectiveness analysis (CEA) and cost‐minimization analysis (CMA), are usually distinguished. In this note, we pronounce the (near) death of CMA by showing the rare circumstances u