An exact penalty function approach for nonlinear integer programming problems

Nonlinear integer programming problems with bounded feasible sets are considered. It is shown how the number of constraints in such problems can be reduced with the aid of an exact penalty function approach. This approach can be used to construct an equivalent unconstrained problem, or a problem wit...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1986, Vol.27 (1), p.50-56
Main Author: Sinclair, Marius
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Integer programming
Mathematical analysis
Mathematical programming
Nonlinear programming
Operational research and scientific management
Operational research. Management science
Operations research
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nonlinear integer programming problems with bounded feasible sets are considered. It is shown how the number of constraints in such problems can be reduced with the aid of an exact penalty function approach. This approach can be used to construct an equivalent unconstrained problem, or a problem with a constraint set which makes it easier to solve. The application of this approach to various nonlinear integer programming problems is discussed.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(86)80006-6