Marginal allocation algorithm for nonseparable functions

Simple item page
dc.citation.epage113en_US
dc.citation.issueNumber2en_US
dc.citation.spage97en_US
dc.citation.volumeNumber37en_US
dc.contributor.authorYüceer, Ü.en_US
dc.date.accessioned2016-02-08T10:41:25Z
dc.date.available2016-02-08T10:41:25Z
dc.date.issued1999en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractMarginal allocation algorithm is implemented to discrete allocation problems with nonseparable objective functions subject to a single linear constraint. A Lagrangian analysis shows that the algorithm generates a sequence of undominated allocations under the condition of discretely convex objective functions and Lagrangian functions. The case of separable functions is proven to be a special case. An application is provided to illustrate the method and various size randomly chosen problems are run to demonstrate the efficiency of the marginal allocation algorithm.en_US
dc.identifier.issn0315-5986
dc.identifier.urihttp://hdl.handle.net/11693/25245
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.source.titleINFOR : information systems and operational research/systemes d'information et recherche operationnelleen_US
dc.subjectDiscrete convexityen_US
dc.subjectMarginal allocation algorithmen_US
dc.subjectNonseparable functionen_US
dc.subjectUndominated allocationen_US
dc.subjectAlgorithmsen_US
dc.subjectConstraint theoryen_US
dc.subjectFunctionsen_US
dc.subjectLagrange multipliersen_US
dc.subjectRandom processesen_US
dc.subjectResource allocationen_US
dc.subjectOperations researchen_US
dc.titleMarginal allocation algorithm for nonseparable functionsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Marginal allocation algorithm for nonseparable functions.pdf
Size:
1.32 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Management