Brunel University, Uxbridge, Middlesex,
UB8 3PH, U.K.
Telephone: 44 1895 274000
shirley.moody@brunel.ac.uk
Abstract
It is well established that Mathematical Programming (MP) problems are modelled within a declarative framework. Consequently algebraic modelling languages are widely accepted in the mathematical programming community as important tools for constructing and analyzing MP problems. There is large class of models, however, in which the coefficients of the constraint matrix cannot be specified immediately in the declarative form using the raw problem data. In these cases many analysts abandon modelling languages and revert to writing computer programmes. This paper addresses this issue by extending a modelling language to link the declarative model statement with the necessary procedures for specifying the columns of the technology matrix. This has the advantage that a considerable amount of the problem owner's domain knowledge can be captured in the modelling phase.
KEYWORDS: Linear programming, procedural knowledge, algebraic
modelling languages, multi-commodity network flow.