So we have to add two non-negativity contraints, x1 >= 0 x2 >= 0 The problem is now in the standard form for linear programming problems: an objective function that is to be maximized, subject to a ...

That’s not to say it’s easy work. It wasn’t until 1983 that the mathematician Hendrik Lenstra proved that the general problem was even solvable, providing the first algorithm that could do it. Lenstra ...

The paper surveys the progress that has been made with the problem of solving linear programming problems when some or all variables are required to take integer values. It is pointed out that there ...