Cookies?
Library Header Image
LSE Research Online LSE Library Services

Fourier-Motzkin elimination extension to integer programming problems

Williams, H. Paul (1976) Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory, Series A, 21 (1). pp. 118-123. ISSN 0097-3165

Full text not available from this repository.

Identification Number: 10.1016/0097-3165(76)90055-8

Abstract

This paper describes how the Fourier-Motzkin Elimination Method, which can be used for solving Linear Programming Problems, can be extended to deal with Integer Programming Problems. The extension derives from a known decision procedure for the formal theory of a fragment of arithmetic which excludes multiplication.

Item Type: Article
Official URL: http://www.elsevier.com/locate/jcta
Additional Information: © 1976 Elsevier Inc
Subjects: Q Science > QA Mathematics
Sets: Research centres and groups > Management Science Group
Departments > Management
Date Deposited: 24 Jan 2011 13:25
Last Modified: 06 Jun 2012 17:17
URI: http://eprints.lse.ac.uk/id/eprint/31614

Actions (login required)

View Item View Item