Inverse Optimization:  An Application to the Capacitated Plant Location Problem

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5161

Full metadata record

DC Field	Value	Language
dc.creator	Bitran, Gabriel R.	-
dc.creator	Sempolinski, Dorothy E.	-
dc.creator	Shapiro, Jeremy F., 1939-	-
dc.date	2004-05-28T19:25:51Z	-
dc.date	2004-05-28T19:25:51Z	-
dc.date	1979-09	-
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/5161	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Inverse optimization refers to the fact that each time a Lagrangean derived from a given mathematical programming problem is solved, it produces an optimal solution to some problem with a different right hand side. This paper reports on the application of inverse optimization to the capacitated plant location problem including the study of implied mappings of dual variables into the space of demand vectors. A new parametric method based on inverse optimization and subgradient optimization is also presented.	-
dc.description	Research supported, in part, by the National Science Foundation under Grant No. MCS77-24654.	-
dc.format	1746 bytes	-
dc.format	1335891 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 091-79	-
dc.title	Inverse Optimization: An Application to the Capacitated Plant Location Problem	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI