Composition Rules for Building Linear Programming Models from Component Models

36 Pages Posted: 31 Oct 2008

See all articles by Frederic Murphy

Frederic Murphy

Temple University - Department of Marketing and Supply Chain Management

Edward A. Stohr

Stevens Institute of Technology - School of Business

Pai-chun MA

affiliation not provided to SSRN

Date Written: March 1990

Abstract

This paper describes some rules for combining component modelsinto complete linear programs. The objective is to lay thefoundations for systems that give users flexibility in designingnew models and reusing old ones, while at the same time,providing better documentation and better diagnostics thancurrently available. The results presented here rely on twodifferent sets of properties of LP models: first, the syntacticrelationships among indices that define the rows and columns ofthe LP, and second, the meanings attached to these indices.These two kinds of information allow us to build a completealgebraic statement of a model from a collection of componentsprovided by the model builder.

Suggested Citation

Murphy, Frederic and Stohr, Edward A. and MA, Pai-chun, Composition Rules for Building Linear Programming Models from Component Models (March 1990). Information Systems Working Papers Series, Vol. , pp. -, 1990. Available at SSRN: https://ssrn.com/abstract=1289741

Frederic Murphy (Contact Author)

Temple University - Department of Marketing and Supply Chain Management ( email )

Philadelphia, PA 19122
United States

Edward A. Stohr

Stevens Institute of Technology - School of Business ( email )

Hoboken, NJ 07030
United States

Pai-chun MA

affiliation not provided to SSRN

No Address Available

Register to save articles to
your library

Register

Paper statistics

Downloads
41
Abstract Views
587
PlumX Metrics