An exact penalty approach for solving a class of minimization problems with boolean variables

DOI10.1080/02331938808843396zbMath0664.90057OpenAlexW1987717911MaRDI QIDQ3815860

Marlies Borchardt

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843396

zbMATH Keywords

global optimizationlinear constraintsBoolean variablesconcave objective functionexact penalty approachmodified Lagrangian approach

Mathematics Subject Classification ID

Nonlinear programming (90C30) Boolean programming (90C09)

Related Items (15)

New results on the equivalence between zero-one programming and continuous concave programming ⋮ Continuous quadratic programming formulations of optimization problems on graphs ⋮ Manifold relaxations for integer programming ⋮ A gradient-based approach for discrete optimum design ⋮ Convergence of a continuous approach for zero-one programming problems ⋮ An exact penalty global optimization approach for mixed-integer programming problems ⋮ Continuous reformulations for zero-one programming problems ⋮ A smoothing method for zero--one constrained extremum problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Unconstrained 0-1 nonlinear programming: A nondifferentiable approach ⋮ An efficient Lagrangian smoothing heuristic for max-cut ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Exact penalty functions for nonlinear integer programming problems ⋮ On duality for Boolean programming ⋮ A global continuation algorithm for solving binary quadratic programming problems

Cites Work

• Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
• Multiplier and gradient methods
• Penalty for zero–one integer equivalent problem
• An Exact Potential Method for Constrained Maxima
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming

This page was built for publication: An exact penalty approach for solving a class of minimization problems with boolean variables