Abstract
Once a model has been formulated along lines described in the previous chapter, it must be specified to the D L P decision support system using the D L P format interface language, henceforth called DLPFI (pronounced ‘Delphi’). Examples of this low-level language have been presented in Chapters 1 and 2. We now give a more detailed and complete description of DLPFI, which has been designed with the following objectives and usage in mind:
-
1.
It provides the means for making a precise statement of a D L P model to the D L P decision support system, in much the same way that standard MPS input format provides the means for precisely specifying a linear programming model to a Mathematical Programming System, for example, MINOS (Murtagh and Saunders [1983]). MPS input format is very rigid—character and numeric data must be provided within specific column ranges in each input record. It is, in essence, a set of conventions for specifying the non-zero elements of a large, sparse LP matrix. In constrast, much of the DLPFI input data is format-free, and local and global constraints and objectives can all be specified with considerable flexibility. Each DLPFI data record has a specific meaning in relation to a D L P model. Thus DLPFI can be viewed as a low-level, simple, very easy-to-learn language for D L P modeling.
-
2.
In conformity with a principle used within most modern modeling systems, DLPFI provides a mechanism for separating D L P modeling and optimization phases. Standard MPS input format plays an identical role vis-à-vis the linear programming model/algorithm interface.
-
3.
DLPFI can serve as a target language for user-supplied front-end routines that are written in a high-level programming or modeling language and can accept data in a more convenient, application-specific way. In standard linear programming, such a set of routines is called a ‘matrix generator’. Here, ‘D L P model generator’ would be the corresponding analog.
-
4.
DLPFI is designed to be extensible, in order to facilitate the implementation of D L P model/algorithm enhancements discussed in Chapter 10.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nazareth, J.L. (2001). The DLPFI Language. In: DLP and Extensions. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56761-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-56761-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62502-2
Online ISBN: 978-3-642-56761-2
eBook Packages: Springer Book Archive