BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-68-102
       ENTRY:: December 20, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Integer programming over a cone
        TYPE:: Technical Report
      AUTHOR:: Pnueli, Amir
        DATE:: July 1968
       PAGES:: 30
    ABSTRACT:: The properties of a special form integer programming problem
               are discussed. We restrict ourselves to optimization over a
               cone (a set of n constraints in n unconstrained variables)
               with a square matrix of positive diagonal and non positive
               off-diagonal elements. (Called a bounding form by F. Glover
               [1964]).

               It is shown that a simple iterational process gives the
               optimal integer solution in a finite number of steps.

               It is then shown that any cone problem with bounded rational
               solution can be transformed to the bounding form and hence
               solved by the outlined method.

               Some extensions to more than n constraints are discussed and
               a numerical example is shown to solve a bigger problem.
       NOTES:: [Adminitrivia V1/Prg/19951220]
         END:: STAN//CS-TR-68-102