’n Algoritme vir die minimum van die konkawe knapsakprobleem
This paper addresses the problem of resource allocation among activities where the cost of each is described by a concave function. There is a single linear constraint (limited resource) and each activity has an upper and lower bound (maximum and minimum resource allocations). The objective is to mi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Operations Research Society of South Africa (ORSSA)
2005-06-01
|
| Series: | ORiON |
| Online Access: | http://orion.journals.ac.za/pub/article/view/16 |