Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMurphy, Frederic H.-
dc.contributor.authorStohr, Edward A.-
dc.contributor.authorMA, Pai-chun-
dc.date.accessioned2006-02-16T14:56:12Z-
dc.date.available2006-02-16T14:56:12Z-
dc.date.issued1990-03-
dc.identifier.urihttp://hdl.handle.net/2451/14486-
dc.description.abstractThis paper describes some rules for combining component models into complete linear programs. The objective is to lay the foundations for systems that give users flexibility in designing new models and reusing old ones, while at the same time, providing better documentation and better diagnostics than currently available. The results presented here rely on two different sets of properties of LP models: first, the syntactic relationships among indices that define the rows and columns of the LP, and second, the meanings attached to these indices. These two kinds of information allow us to build a complete algebraic statement of a model from a collection of components provided by the model builder.en
dc.format.extent5183711 bytes-
dc.format.mimetypeapplication/pdf-
dc.languageEnglishEN
dc.language.isoen_US-
dc.publisherStern School of Business, New York Universityen
dc.relation.ispartofseriesIS-87-30-
dc.titleCOMPOSITION RULES FOR BUILDING LINEAR PROGRAMMING MODELS FROM COMPONENT MODELSen
dc.typeWorking Paperen
dc.description.seriesInformation Systems Working Papers SeriesEN
Appears in Collections:IOMS: Information Systems Working Papers

Files in This Item:
File Description SizeFormat 
IS-87-30.pdf5.06 MBAdobe PDFView/Open


Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.