An exact penalty function approach for n
โ
Marius Sinclair
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 344 KB
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