Algoritmes vir die maksimering van konvekse en verwante knapsakprobleme

Algoritmes vir die maksimering van konvekse en verwante knapsakprobleme

Thesis (PhD (Logistics))--University of Stellenbosch, 2007. === In this dissertation original algorithms are introduced to solve separable resource allocation problems (RAPs) with increasing nonlinear functions in the objective function, and lower and upper bounds on each variable. Algorithms are...

Full description

Bibliographic Details
Main Author: Visagie, Stephan E.
Other Authors: De Kock, H. C.
Language:af
Published: Stellenbosch : University of Stellenbosch 2008
Subjects:
Algoritme
Knapsack problem (Mathematics)
Computer algorithms
Mathematical optimization
Convex programming
Dissertations > Logistics
Theses > Logistics
Online Access:http://hdl.handle.net/10019.1/1082

Internet

http://hdl.handle.net/10019.1/1082

Similar Items