Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

The computational results on problems with up to 2750 variables strongly confirm our hypothesis that a combination of problem preprocessing, cutting planes, and clever branch-and-bound techniques ...

The purpose of this paper is to develop a useful technique for solving linear programmes involving more than one objective function. Motivation for solving multicriterion linear programmes is given ...