Williams, H. Paul (2000) The dual of a logical linear programme. Journal of Global Optimization, 18 (2). pp. 129-141. ISSN 0925-5001
Full text not available from this repository.
Identification Number: 10.1023/A:1008328500933
Abstract
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 |
|---|---|
| Official URL: | http://www.springer.com/business+%26+management/op... |
| Additional Information: | © 2000 Elsevier Academic Publishers |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 24 Jan 2011 10:14 |
| Last Modified: | 13 Sep 2024 21:18 |
| URI: | http://eprints.lse.ac.uk/id/eprint/31584 |
Actions (login required)
 |
View Item |
