Implementation of two-dimensional integer programming

Asked Jun 10 '21 at 20:07

Active Jun 10 '21 at 20:14

Viewed 110 times

I have a 2x2 integer matrix A and 2d integers vectors b, c. I want to maximize c∙x under the constrains x≥0 and Ax≤b when x ranges over 2d integer vectors. This is a canonical form of two-dimensional integer linear program.

Is there an implementation of an efficient algorithm solving this problem with clear documentation/explanation?

It is easy to find some academic papers but I find it challenging to implement the pseudocode from those papers.

edited Jun 10 '21 at 20:14

asked Jun 10 '21 at 20:07

jtallk

2

It may be easier to use a solver rather than writing your own. – Erwin Kalvelagen Jun 10 '21 at 21:10
@ErwinKalvelagen Do you have some specific solver in mind? – jtallk Jun 11 '21 at 04:59
This is a tiny MIP so any solver will do. Things may depend on from which environment you are calling it (C, Python, R etc), Google typically finds good suggestions. – Erwin Kalvelagen Jun 11 '21 at 07:18

Implementation of two-dimensional integer programming

0 Answers0