Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/9624
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lahiri, Somdeb | |
dc.date.accessioned | 2010-10-14T05:19:55Z | |
dc.date.available | 2010-10-14T05:19:55Z | |
dc.date.copyright | 2000 | |
dc.date.issued | 2000-10-14T05:19:55Z | |
dc.identifier.uri | http://hdl.handle.net/11718/9624 | |
dc.description | Opsearch, Vol. 37, No.2, (2000) | en |
dc.description.abstract | In 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.iso | en | en |
dc.subject | Vector Optimization | en |
dc.title | Reducing a multi stage vector optimization problem | en |
dc.type | Article | en |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
124-133.pdf Restricted Access | 2.68 MB | Adobe PDF | View/Open Request a copy |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.