A Partial Ranking Algorithm for Resource Allocation Problems

A.M.B. De Waegenaere, J.L. Wielhouwer

Research output: Working paperDiscussion paperOther research output

225 Downloads (Pure)

Abstract

We present an algorithm to solve resource allocation problems with a single resource, a convex separable objective function, a convex separable resource-usage constraint and bounded variables.Through evaluation of specific functions in the lower and/or upper bounds, we obtain information on whether or not these bounds are binding.Once this information is available for all variables, the optimum is found through determination of the unique root of a strictly decreasing function.A comparison is made with the currently known most efficient algorithms.
Original languageEnglish
Place of PublicationTilburg
PublisherAccounting
Number of pages22
Volume2001-40
Publication statusPublished - 2001

Publication series

NameCentER Discussion Paper
Volume2001-40

Fingerprint

Resources
Ranking
Allocation problem
Resource allocation
Objective function
Upper bound
Evaluation

Keywords

  • Programming
  • non-linear

Cite this

De Waegenaere, A. M. B., & Wielhouwer, J. L. (2001). A Partial Ranking Algorithm for Resource Allocation Problems. (CentER Discussion Paper; Vol. 2001-40). Tilburg: Accounting.
De Waegenaere, A.M.B. ; Wielhouwer, J.L. / A Partial Ranking Algorithm for Resource Allocation Problems. Tilburg : Accounting, 2001. (CentER Discussion Paper).
@techreport{8b2e018536f943df8a3dd1bb7c117c9f,
title = "A Partial Ranking Algorithm for Resource Allocation Problems",
abstract = "We present an algorithm to solve resource allocation problems with a single resource, a convex separable objective function, a convex separable resource-usage constraint and bounded variables.Through evaluation of specific functions in the lower and/or upper bounds, we obtain information on whether or not these bounds are binding.Once this information is available for all variables, the optimum is found through determination of the unique root of a strictly decreasing function.A comparison is made with the currently known most efficient algorithms.",
keywords = "Programming, non-linear",
author = "{De Waegenaere}, A.M.B. and J.L. Wielhouwer",
note = "Pagination: 22",
year = "2001",
language = "English",
volume = "2001-40",
series = "CentER Discussion Paper",
publisher = "Accounting",
type = "WorkingPaper",
institution = "Accounting",

}

De Waegenaere, AMB & Wielhouwer, JL 2001 'A Partial Ranking Algorithm for Resource Allocation Problems' CentER Discussion Paper, vol. 2001-40, Accounting, Tilburg.

A Partial Ranking Algorithm for Resource Allocation Problems. / De Waegenaere, A.M.B.; Wielhouwer, J.L.

Tilburg : Accounting, 2001. (CentER Discussion Paper; Vol. 2001-40).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - A Partial Ranking Algorithm for Resource Allocation Problems

AU - De Waegenaere, A.M.B.

AU - Wielhouwer, J.L.

N1 - Pagination: 22

PY - 2001

Y1 - 2001

N2 - We present an algorithm to solve resource allocation problems with a single resource, a convex separable objective function, a convex separable resource-usage constraint and bounded variables.Through evaluation of specific functions in the lower and/or upper bounds, we obtain information on whether or not these bounds are binding.Once this information is available for all variables, the optimum is found through determination of the unique root of a strictly decreasing function.A comparison is made with the currently known most efficient algorithms.

AB - We present an algorithm to solve resource allocation problems with a single resource, a convex separable objective function, a convex separable resource-usage constraint and bounded variables.Through evaluation of specific functions in the lower and/or upper bounds, we obtain information on whether or not these bounds are binding.Once this information is available for all variables, the optimum is found through determination of the unique root of a strictly decreasing function.A comparison is made with the currently known most efficient algorithms.

KW - Programming

KW - non-linear

M3 - Discussion paper

VL - 2001-40

T3 - CentER Discussion Paper

BT - A Partial Ranking Algorithm for Resource Allocation Problems

PB - Accounting

CY - Tilburg

ER -

De Waegenaere AMB, Wielhouwer JL. A Partial Ranking Algorithm for Resource Allocation Problems. Tilburg: Accounting. 2001. (CentER Discussion Paper).