.png){kind=icon}
Return
TOOLS FOR REFORMULATING LOGICAL FORMS INTO ZERO-ONE MIXED-INTEGER PROGRAMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)90308-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Programming (ILP) formulation or a Mixed Integer Programming (MIP) formulation is presented. A reformulation procedure which uses the extended reverse Polish notation to represent a compound logical form is then described. The syntax of an LP modelling language is extended to incorporate statements in propositional logic forms with linear algebraic forms whereby 0-1 MIP models can be automatically formulated. A prototype user interface by which logical forms can be reformulated and the corresponding MIP constructed and analysed within an existing Mathematical Programming modelling system is illustrated. Finally, the steps to formulate a discrete optimisation model in this way are illustrated by means of an example.
Keywords:
MATHEMATICAL PROGRAMMING
LINEAR PROGRAMMING MODELING LANGUAGES
PROPOSITIONAL CALCULUS
FIRST ORDER LOGIC
LOGICAL PROGRAMMING
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave no more
no more