Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/9624
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLahiri, Somdeb
dc.date.accessioned2010-10-14T05:19:55Z
dc.date.available2010-10-14T05:19:55Z
dc.date.copyright2000
dc.date.issued2000-10-14T05:19:55Z
dc.identifier.urihttp://hdl.handle.net/11718/9624
dc.descriptionOpsearch, Vol. 37, No.2, (2000)en
dc.description.abstractIn this paper we study the problem of universally reducing a multi-stage vector optimization problem to a one-stage vector problem. Our analysis is restricted to the case of finite sets of alternatives and thus has independent appeal from the standpoint of finite/discrete mathematics as well.
dc.language.isoenen
dc.subjectVector Optimizationen
dc.titleReducing a multi stage vector optimization problemen
dc.typeArticleen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
124-133.pdf
  Restricted Access
2.68 MBAdobe PDFView/Open Request a copy


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