Algorithms for Separable Nonlinear Resource Allocation Problems

A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex performance functions, 1 for each activity. Likewise, the constraint has separable, convex resource-usage functions, 1 for each activity. The objectiv...

Celý popis

Podrobná bibliografia

Vydané v:	Operations research Ročník 46; číslo 2; s. 272
Hlavní autori:	Kodialam, Muralidharan S, Luss, Hanan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Linthicum Institute for Operations Research and the Management Sciences 01.03.1998
Predmet:	Algorithms Nonlinear programming Operations research Resource allocation Studies Theory
ISSN:	0030-364X, 1526-5463
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!