DSpace Repository

Duality Based Characterizations of Efficient Facets

Show simple item record

dc.creator Bitran, Gabriel R.
dc.creator Magnanti, Thomas L.
dc.date 2004-05-28T19:25:54Z
dc.date 2004-05-28T19:25:54Z
dc.date 1979-10
dc.date.accessioned 2013-10-09T02:38:02Z
dc.date.available 2013-10-09T02:38:02Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/5162
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Most practical applications of multicriteria decision making can be formulated in terms of efficient points determined by preference cones with polyhedral closure. Using linear approximations and duality from mathematical programming, we characterize a family of supporting hyperplanes that define the efficient facets of a set of alternatives with respect to such preference cones. We show that a subset of these hyperplanes generate maximal efficient facets. These characterizations permit us to devise a new algorithm for generating all maximal efficient facets of multicriteria optimization problems with polyhedral structure.
dc.description Supported in part by the National Science Foundation grant MCS77-24654. Supported in part by the Army Research Office (Durham) contract DAAG29-76-C-0064.
dc.format 1746 bytes
dc.format 1234775 bytes
dc.format application/pdf
dc.language en_US
dc.publisher Massachusetts Institute of Technology, Operations Research Center
dc.relation Operations Research Center Working Paper;OR 092-79
dc.title Duality Based Characterizations of Efficient Facets
dc.type Working Paper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account