Nonlinear integer programming for various forms of constraints

Mary W. Cooper and Keyvan Farhangian

Naval Research Logistics Quarterly, 1982, vol. 29, issue 4, 585-592

Abstract: 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.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800290406

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:29:y:1982:i:4:p:585-592

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().