Nonlinear integer programming for various forms of constraints

Autor: Keyvan Farhangian, Mary W. Cooper
Rok vydání: 1982
Předmět:
Zdroj: Naval Research Logistics Quarterly. 29:585-592
ISSN: 1931-9193
0028-1441
DOI: 10.1002/nav.3800290406
Popis: A theoretical and computational investigation is made of the performance of a dynamic-programming-based algorithm for nonlinear integer problems with various types of constraints. We include linear constraints, aggregated linear constraints, separable nonlinear constraints and constraints involving maxima and minima. Separability of the objective function is assumed. The new feature of the algorithm is that two types of fathoming or pruning are used to reduce the size of tables and number of computations: fathoming by bounds and fathoming by infeasibility.
Databáze: OpenAIRE