Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2181
Title: Transformation of propositional calculus statements into integer and mixed integer programs: An approach towards automatic reformulation
Authors: Hadjiconstantinou, E
Issue Date: 1990
Publisher: Brunel University
Citation: Maths Technical Papers (Brunel University). November 1990 , pp 1-28
Abstract: A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Progamming (ILP) formulation Mixed Integer Programming (MIP) formulation is presented. An ILP stated as a system of linear constraints involving integer variables and an objective function, provides a powerful representation of decision problems through a tightly interrelated closed system of choices. It supports direct representation of logical (Boolean or prepositional calculus) expressions. Binary variables (hereafter called logical variables) are first introduced and methods of logically connecting these to other variables are then presented. Simple constraints can be combined to construct logical relationships and the methods of formulating these are discussed. A reformulation procedure which uses the extended reverse polish representation of a compound logical form is then described. These reformulation procedures are illustrated by two examples. A scheme of implementation.ithin an LP modelling system is outlined.
URI: http://bura.brunel.ac.uk/handle/2438/2181
Appears in Collections:Mathematical Science
Dept of Mathematics Research Papers

Files in This Item:
File Description SizeFormat 
TR_11_90.pdf373.58 kBAdobe PDFView/Open


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