Imperial College London

MrLloydKamara

Faculty of EngineeringDepartment of Computing

Computing Support Manager
 
 
 
//

Contact

 

+44 (0)20 7594 8400l.kamara Website

 
 
//

Location

 

305Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@techreport{Spacey:2009:10.25561/95278,
author = {Spacey, SA},
booktitle = {Departmental Technical Report: 09/7},
doi = {10.25561/95278},
publisher = {Department of Computing, Imperial College London},
title = {Concise cplex},
url = {http://dx.doi.org/10.25561/95278},
year = {2009}
}

RIS format (EndNote, RefMan)

TY  - RPRT
AB - This paper is a concise guide to CPLEX, the leading solverfor linear and convex quadratic optimisation problems. Thepaper is self contained and includes information for firsttime CPLEX users as well as code snippets and lemmas thatmay be of referential value to experienced users.The paper starts with a brief explanation of how to runCPLEX on departmental servers at Imperial and on standalonemachines in section 1, how to create and solve simpleLinear Programs in section 2 and how to obtain detailed solutionresults in section 3. The paper then moves on to discussseveral CPLEX issues and quirks that may confuse firsttime users including: anomalous objective values causedby big-M scaling, the implications of long MILP solutiontimes and removing memory limitations for problems withlarge MILP solution trees. The paper concludes with logicalequivalence proofs in section 9 that can be used as a startingpoint for complex problem translation and references areprovided for additional reading.
AU - Spacey,SA
DO - 10.25561/95278
PB - Department of Computing, Imperial College London
PY - 2009///
TI - Concise cplex
T1 - Departmental Technical Report: 09/7
UR - http://dx.doi.org/10.25561/95278
UR - http://hdl.handle.net/10044/1/95278
ER -