Theory and methodology
An approximate algorithm for nonlinear integer programming

https://doi.org/10.1016/0377-2217(94)90215-1Get rights and content

Abstract

This paper suggests an approximate algorithm, designed to solve nonlinear integer problems. This algorithm belongs to the class of component algorithms of feasible integer directions. The search for a feasible integer direction is done on the basis of a linear approximation of the objective function and the constraints at the integer points under consideration. Theoretical analysis is presented, as well as experimental investigation, using the algorithm for test examples taken from the literature.

References (12)

  • S.H. Zanakis et al.

    Heuristic methods and applications: A categorized survey

    European Journal of Operational Research

    (1989)
  • J.K. Britton

    Integer solution of systems of quadratic equations

  • O.K. Gupta et al.

    Nonlinear integer programming and discrete optimization

    Transactions of the ASME

    (1983)
  • O.K. Gupta et al.

    Branch and bound experiments in convex nonlinear integer programming

    Management Science

    (1985)
  • L.G. Hachian

    Convexity and algorithmic complexity of polinomial programming problems solving

    Izvestiya Academy of Sciences USSR. Technical Cybernetics

    (1982)
  • R.G. Jeroslaw

    There cannot be any algorithm for integer programming with quadratic constraints

    Operations Research

    (1973)
There are more references available in the full text version of this article.

Cited by (0)

View full text