Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/1821
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Satyendra-
dc.contributor.authorRao, V. Venkata-
dc.contributor.authorTirupati, Devanath-
dc.date.accessioned2010-03-31T03:58:29Z-
dc.date.available2010-03-31T03:58:29Z-
dc.date.copyright2003-11-03-
dc.date.issued2010-03-31T03:58:29Z-
dc.identifier.urihttp://hdl.handle.net/11718/1821-
dc.description.abstractThis paper presents the formulation and a hierarchical solution procedure of multiple products, multiple constraints, single period inventory problem. The hierarchical procedure decomposes the problem into a number of sub-problems equal to the number of constraints sets. Each sub-problem is solved optimally by applying Lagrange multipliers and satisfying Kuhn-Tucker conditions. The experimental results show that the hierarchical procedure performs well even when there are large a number of products and constraints.en
dc.language.isoenen
dc.relation.ispartofseriesWP;2003/1784-
dc.subjectNewsboy problemen
dc.subjectSingle - period inventory problemen
dc.titleMultiple products, multiple constraints, single period inventory problem: a hierarchical solution procedureen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
2003-11-03satyendra.pdf261.97 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.