Location of Repository

Integer programming (IP), also known as discrete optimization, is a way of modelling a very wide range of problems involving indivisibilities (e.g. yes/no investment decisions) and non-convexities (e.g. economies of scale and fixed cost allocation). Such problems arise in many areas; these are mentioned in the paper. However, IP demands ingenuity in both building models and in their solution. Much is still not properly understood. This paper investigates the question: ‘Is IP like Linear Programming (LP)? ’ The mathematical and economic properties of IP will be contrasted with LP. It will be suggested that the mathematics and economics of IP are still not properly understood. Many of the results which apply to LP do not apply to IP. It will be asserted that this lack of understanding reveals inadequacies in both the mathematics and economics. Published online October 5th, 2010

Topics:
QA Mathematics

Publisher: Oxford University Press on behalf of the Institute of Mathematics and its Applications

Year: 2011

DOI identifier: 10.1093/imaman

OAI identifier:
oai:eprints.lse.ac.uk:27100

Provided by:
LSE Research Online

- 1882 Système pratique et raisonne de representation propoortionnelle, Bruxelles: Librarie
- (1984). A duality theorem for linear congruences.
- (1972). A Theory of Justice,
- (2005). A. Direct solution of linear systems of size 10 9 arising in optimization and interior pont methods. In
- (1963). An algorithm for integer solutions to linear programs.
- (1977). An observation on the structure of production sets with indivisibilities
- (1996). Constructing the value function for an integer linear programme over a cone.
- (1995). Discrete subadditive functions as Gomory functions.
- (1973). Edmonds polytopes and a hierarchy of combinatorial problems.
- European Election Results,
- (1982). Fair Apportionment, 2 nd Edition,
- (1986). Fourier’s method of linear programming and its dual.
- (1958). Linear Programming and Economic Analysis,
- (1963). Linear Programming and Extensions,
- (2009). Logic and Integer Programming,
- (2000). Logic-based Methods of Optimization,
- (1999). MIP: Theory and practiceclosing the gap,
- (1999). Model Building
- (1978). On a linear Diophantine problem of Frobenius,
- (1997). Representing integral monoids by inequalities,
- (2006). The allocation of shared fixed costs.
- (1981). The b-hull of an integer programme.
- (1996). The equivalence of two theorems of integer programming
- (1995). The Travelling Salesman Problem,
- (1982). The value function of an integer program
- (1986). Theory of Linear and Integer Programming.
- (1994). Weyl-Minkowski duality for integral monoids,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.