Penalty formulation for zero-one nonlinear programming

DOI10.1016/0166-218X(87)90073-4zbMath0622.90059MaRDI QIDQ1091262

Bahman Kalantari, J. Ben Rosen

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

global optimization; concave minimization; penalty formulations

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C09: Boolean programming

Related Items

A revised Taha's algorithm for polynomial 0-1 programming, Manifold relaxations for integer programming, Continuous reformulations for zero-one programming problems, On duality for Boolean programming, New results on the equivalence between zero-one programming and continuous concave programming, Exact penalty functions for nonlinear integer programming problems, Unconstrained 0-1 nonlinear programming: A nondifferentiable approach, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, An exact penalty global optimization approach for mixed-integer programming problems, Continuous quadratic programming formulations of optimization problems on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Penalty for zero–one integer equivalent problem
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Methods of Nonlinear 0-1 Programming
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints