Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/13314
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKhanra, Avijit
dc.date.accessioned2015-04-22T12:04:59Z
dc.date.available2015-04-22T12:04:59Z
dc.date.issued2014
dc.identifier.urihttp://hdl.handle.net/11718/13314
dc.description.abstractPreference of satiation of a target performance over maximization of expected performance in uncertain situations is well-documented in the economics literature. However, the newsboy problem with satiation (of a pro t target) objective has not received its due attention. In the multi-product setting, solution methods available in the literature are ine cient. We developed an e cient heuristic to solve the problem. The heuristic decomposes the multi-product problem into easily solvable single-product problems. We tested the heuristic with a large number of test instances. The heuristic can be adopted to solve the target assignment problem. We demonstrated it with some numerical examples.en_US
dc.language.isoenen_US
dc.publisherIndian Institute of Management, Ahmedabaden_US
dc.relation.ispartofseriesWP;2419
dc.subjectNewsboy problemen_US
dc.subjectEfficient heuristicen_US
dc.titleAn efficient heuristic for the multi-product satiating newsboy problemen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP002419.pdfWP002419336 kBAdobe PDFView/Open


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