Penalty formulation for zero-one nonlinear programming
type: Item
instance of: scholarly article
title: Penalty formulation for zero-one nonlinear programming
zbMATH Open document ID: 0622.90059
DOI: 10.1016/0166-218X(87)90073-4
author: Bahman Kalantari
author: J. B. Rosen
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: \textit{M. Raghavachari} [Oper. Res. 17, 680-684 (1969; Zbl 0176.498)] has shown the equivalence of zero-one integer programming and a concave quadratic penalty function for a sufficiently large value of the penalty. A lower bound for this penalty was found by the authors [Math. Program. 24, 229-232 (1982; Zbl 0539.90074)]. It was also shown that this penalty could not be reduced in specific cases. We show that the results generalize to the case where the objective function is any concave function. Equivalent penalty formulation for non-concave functions is also considered.
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 4010212
zbMATH Keywords: penalty formulations
zbMATH Keywords: concave minimization
zbMATH Keywords: global optimization
MaRDI profile type: Publication
cites work: Q4187223
cites work: Q3294638
cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization
cites work: Methods of Nonlinear 0-1 Programming
cites work: Penalty for zero–one integer equivalent problem
cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
description: scientific article; zbMATH DE number 4010212