An Algorithm for a Nonlinear Discontinuous Knapsack Problem

This paper presents a solution procedure for a class of discontinuous nonlinear knapsack problems. These problems have a single linear constraint and a restriction that each variable must be either zero or take on a value within a specified interval. The objective function is separable and each term...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Management science Ročník 25; číslo 9; s. 884 - 894
Hlavní autori: Armstrong, R. D, Cook, W. D, Palacios-Gomez, F. E
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Linthicum INFORMS 01.09.1979
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edícia:Management Science
Predmet:
Algorithms
Approximation
branch-and-bound
Budgets
Capital budgeting
Computer programming
Descendants
Index sets
Investment return rates
Knapsack problem
Linear programming
Mathematical minima
Nonlinear programming
nonlinear programming algorithms
Optimal solutions
Problem solving
Relaxation
Zero
ISSN:0025-1909, 1526-5501
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper presents a solution procedure for a class of discontinuous nonlinear knapsack problems. These problems have a single linear constraint and a restriction that each variable must be either zero or take on a value within a specified interval. The objective function is separable and each term is concave within the interval. Problems of this type arise in capital budgeting and a particular application in the scheduling of pavement maintenance is given. The branch-and-bound algorithm developed to solve the problem considers an approximation-relaxation at each step. Computational experience with the algorithm and a brief overview of applications of the model are given.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.25.9.884