Discrete optimization

Abstract
This paper presents some theoretical ideas for the discrete non-linear programming problem. The main objective in to construct a hypercube inside of which the discrete optimum will lie. It is shown that for quadratic functions this hypercube can be constructed by knowing the inverse of the hessian matrix.

This publication has 2 references indexed in Scilit: