| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

Lebanese Writer Amin Maalouf; Learning From Trump; Chinese Writer Hu Fayun; C++ - it's the language of the future; And; Apricot Jam; Also; Excellent Article on USA Politics; Oh Metafilter; Prejudice Against The Rurals; Also, Zizek; Trump; Why Trump Won; Doxygen + Latex on CentOS 6; SMASH - Solve 5 Biggest Problems in Physics; Good article on racism, brexit, and social divides; Grandaddy are back!; Consciousness From Max Entropy; Democrats; Harvard Will Fix Black Poverty; Modelling Bicycle Wheels; Amusing Polling Outlier; If Labour keeps telling working class people...; Populism and Choice; Books on Defeat; Enrique Ferrari - Argentine Author; Transcript of German Scientists on Learning of Hiroshima; Calvert Journal; Owen Jones on Twitter; Possible Japanese Authors; Complex American Literature; Chutney v5; Weird Componentized Virus; Interesting Argentinian Author - Antonio Di Benedetto; Useful Thread on MetaPhysics; RAND on fighting online anarchy (2001); NSA Hacked; Very Good LRB Article on Brexit; Nussbaum on Anger; Tasting; Apple + Kiwi Jam; Hit Me; Sudoku - CSP + Chaos; Recycling Electronics In Santiago; Vector Displays in OpenGL; And Anti-Aliased; OpenGL - Render via Intermediate Texture; And Garmin Connect; Using Garmin Forerunner 230 With Linux; (Beating Dead Horse) StackOverflow; Current State of Justice in China; Axiom of Determinacy; Ewww; Fee Chaos Book; Course on Differential Geometry; Okay, but...; Sparse Matrices, Deep Learning; Sounds Bad; Applebaum Rape; Tomato Chutney v4; Have to add...; Culturally Liberal and Nothing More; Weird Finite / Infinite Result; Your diamond is a beaten up mess; Maths Books; Good Bike Route from Providencia / Las Condes to Panul; Iain Pears (Author of Complex Plots); Plum Jam; Excellent; More Recently; For a moment I forgot StackOverflow sucked; A Few Weeks On...; Chilean Book Recommendations; How To Write Shared Libraries; Jenny Erpenbeck (Author); Dijkstra, Coins, Tables; Python libraries error on OpenSuse; Deserving Trump; And Smugness; McCloskey Economics Trilogy; cmocka - Mocks for C; Concept Creep (Americans); Futhark - OpenCL Language; Moved / Gone; Fan and USB issues; Burgers in Santiago; The Origin of Icosahedral Symmetry in Viruses; autoenum on PyPI; Jars Explains; Tomato Chutney v3; REST; US Elections and Gender: 24 Point Swing; PPPoE on OpenSuse Leap 42.1; SuperMicro X10SDV-TLN4F/F with Opensuse Leap 42.1; Big Data AI Could Be Very Bad Indeed....; Cornering; Postcapitalism (Paul Mason); Black Science Fiction; Git is not a CDN; Mining of Massive Data Sets; Rachel Kaadzi Ghansah

© 2006-2015 Andrew Cooke (site) / post authors (content).

Mixed Integer Programming in Python

From: andrew cooke <andrew@...>

Date: Mon, 29 Aug 2011 17:22:25 -0300

The weather in NY has left me with a free afternoon at work, so I have been
looking at mixed integer programming (this is not completely self-indulgent -
it's related to compressive sensing, which we might use).

My motivating example was this question on Stack Overflow -
http://stackoverflow.com/questions/7076349/is-there-a-good-way-to-do-this-type-of-mining

These notes describe largely separate (because I didn't get very far) aspects:
describing that particular problem and Python libraries.


Python Libraries

It seems that mixed integer and linear programming are not, in general, well
supported by open source projects.  See, for example, the comparison of
running times for commercial and open source solutions here:
http://scip.zib.de/

Support in Python reflects that.  My initial candidate was pulp-or
http://code.google.com/p/pulp-or/ but many links there are dead (with ominous
notes about a "transition").  So then I turned to Coopr
https://software.sandia.gov/trac/coopr which, from the text there, may be what
pulp-or is combining with.  However, the documentation was both minimal and
aimed at experts - I really need something more introductory.

At this point I started looking for an implementation in any language, and
identified SCIP http://scip.zib.de/ (as mentioned earlier) as one of the most
active and efficient.  And - a rare positive moment within this work - it has
a Python 3.2 library that looks very nice
http://code.google.com/p/python-zibopt/ although the installation instructions
suggest things are still rather alpha
http://code.google.com/p/python-zibopt/wiki/Installation


Framing the Problem

At first I assumed that the clustering problem described above would be easy
to solve.  But all my initial approaches contained variable numbers of
variables.  This can be avoided, to some extent, by using control variables,
which are binary flags that indicate whether some other variable is used or
not, but the next problem was how to express various constraints as linear
expressions.

I still don't have a perfect solution, but here are some notes to remind me of
how far I have got:

 - By default, every point is in the vertical group for that column.
 - We want to minimise the number of vertical groups, while also minimising
   "gaps" in horizontal groups.
 - Each point has a vertical (1) / horizontal (0) control variable.  The sum
   of these is one contribution to the final weight.
 - Each point has an additional variable which is the horizontal group
   number.  Originally these start at 0 (left) and increment across the row.
 - The sum of the rightmost group number on each row is also minimised.
   This reduces the number of groups.
 - There is a constraint that each successive group number from left to
   right must be the same as the neighbour to the left, or one more.
 - Finally, there is a complex weight that depends on the number of 
   horizontal "gaps" between two points when they have the same group 
   number.  I think this can be generated programmatically, but it's a bit
   complex (especially since it must be ignored when groups are vertical).
   This weight should also be minimised.

Writing that down, it doesn't seem very impressive, but it was a lot of
work... :o(

Andrew

Non-Comemrcial

From: andrew cooke <andrew@...>

Date: Mon, 29 Aug 2011 19:01:52 -0300

The SCIP and related code is non-commercial only.

Andrew

lp_solve

From: andrew cooke <andrew@...>

Date: Mon, 29 Aug 2011 19:40:46 -0300

OK, so it seems like the best-supported (but not fastest or ost advanced)
package is lp_solve, and it also has some kind of python interface.

http://lpsolve.sourceforge.net/

Andrew

Comment on this post