A Graphical Method to Solve a Family of Allocation Problems

Rene Victor Valqui Vidal

A Graphical Method to Solve a Family of Allocation Problems

Rene Victor Valqui Vidal

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied to a family of well-known problems from the literature.

Original language	English
Journal	European Journal of Operational Research
Volume	17
Issue number	1
Pages (from-to)	31-34
ISSN	0377-2217
Publication status	Published - 1984

Access to Document

http://www2.imm.dtu.dk/pubdb/p.php?3682

Fingerprint Dive into the research topics of 'A Graphical Method to Solve a Family of Allocation Problems'. Together they form a unique fingerprint.

Cite this

@article{d95228643c1f48fa95e6175eb4a7f68a,

title = "A Graphical Method to Solve a Family of Allocation Problems",

abstract = "This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied to a family of well-known problems from the literature.",

keywords = "Lagrange multipliers, allocation, optimization",

author = "Vidal, {Rene Victor Valqui}",

year = "1984",

language = "English",

volume = "17",

pages = "31--34",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - A Graphical Method to Solve a Family of Allocation Problems

AU - Vidal, Rene Victor Valqui

PY - 1984

Y1 - 1984

N2 - This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied to a family of well-known problems from the literature.

AB - This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied to a family of well-known problems from the literature.

KW - Lagrange multipliers

KW - allocation

KW - optimization

M3 - Journal article

VL - 17

SP - 31

EP - 34

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -