Marginal allocation algorithm for nonseparable functions
dc.contributor.author | Yüceer, Ü. | en_US |
dc.date.accessioned | 2016-02-08T10:41:25Z | |
dc.date.available | 2016-02-08T10:41:25Z | |
dc.date.issued | 1999 | en_US |
dc.identifier.issn | 0315-5986 | |
dc.identifier.uri | http://hdl.handle.net/11693/25245 | |
dc.description.abstract | Marginal 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.language.iso | English | en_US |
dc.source.title | INFOR : information systems and operational research/systemes d'information et recherche operationnelle | en_US |
dc.subject | Discrete convexity | en_US |
dc.subject | Marginal allocation algorithm | en_US |
dc.subject | Nonseparable function | en_US |
dc.subject | Undominated allocation | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Constraint theory | en_US |
dc.subject | Functions | en_US |
dc.subject | Lagrange multipliers | en_US |
dc.subject | Random processes | en_US |
dc.subject | Resource allocation | en_US |
dc.subject | Operations research | en_US |
dc.title | Marginal allocation algorithm for nonseparable functions | en_US |
dc.type | Article | en_US |
dc.department | Department of Management | en_US |
dc.citation.spage | 97 | en_US |
dc.citation.epage | 113 | en_US |
dc.citation.volumeNumber | 37 | en_US |
dc.citation.issueNumber | 2 | en_US |
dc.publisher | Taylor & Francis | en_US |
Files in this item
This item appears in the following Collection(s)
-
Department of Management 639
MAN