The dual of a logical linear programme
Williams, H. P.
(2000).
The dual of a logical linear programme.
Journal of Global Optimization,
18(2), 129-141.
https://doi.org/10.1023/A:1008328500933
A Linear Programme (LP) involves a conjunction of linear constraints and has a well defined dual. It is shown that if we allow the full set of Boolean connectives {and, or, sim} applied to a set of linear constraints we get a model which we define as a Logical Linear Programme (LLP). This also has a well defined dual preserving most of the properties of LP duality. Generalisations of the connectives are also considered together with the relationship with Integer Programming formulation.
| Item Type | Article |
|---|---|
| Copyright holders | © 2000 Elsevier Academic Publishers |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1023/A:1008328500933 |
| Date Deposited | 24 Jan 2011 |
| URI | https://researchonline.lse.ac.uk/id/eprint/31584 |
Explore Further
- https://www.scopus.com/pages/publications/0346742283 (Scopus publication)
- http://www.springer.com/business+%26+management/op... (Official URL)