Show simple item record

dc.contributor.authorBenjamin, Michael R.
dc.date.accessioned2005-12-19T23:28:02Z
dc.date.available2005-12-19T23:28:02Z
dc.date.issued2004-09-27
dc.identifier.otherMIT-CSAIL-TR-2004-058
dc.identifier.otherAIM-2004-021
dc.identifier.urihttp://hdl.handle.net/1721.1/30416
dc.description.abstractThe interval programming model (IvP) is a mathematical programmingmodel for representing and solving multi-objective optimizationproblems. The central characteristic of the model is the use ofpiecewise linearly defined objective functions and a solution methodthat searches through the combination space of pieces rather thanthrough the actual decision space. The piecewise functions typicallyrepresent an approximation of some underlying function, but thisconcession is balanced on the positive side by relative freedom fromfunction form assumptions as well as the assurance of global optimality.In this paper the model and solution algorithms are described, and theapplicability of IvP to certain applications arediscussed.
dc.format.extent32 p.
dc.format.extent42228177 bytes
dc.format.extent2845444 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subjectAI
dc.subjectmulti-objective decision making
dc.subjectbehavior-based control
dc.subjectaction selection
dc.subjectMCDM
dc.titleThe Interval Programming Model for Multi-objective Decision Making


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record