Now showing items 1-2 of 2
Computational Experience with Lenstra's Algorithm
Integer programming is an important mathematical approach for many decision-making problems. In this field, a major theoretical breakthrough came in 1983 when H. W. Lenstra, Jr. proposed a polynomial-time algorithm for a ...
On Numerical Solution of the Maximum Volume Ellipsoid Problem
In this paper we study practical solution methods for finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in R n defined by a finite set of affine inequalities. Our goal is to design a ...