An exact penalty approach for solving a class of minimization problems with boolean variables
Author:
- M. BorchardtMBM. Borchardt
- 1 January 1988
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 19 (6) , 829-838
Abstract
An exact penalty approach for solving minimization problems with a concave objective function, linear constraints and Boolean variables is proposed. The penalty problems have continuous variables. An estimation of the penalty parameter which guarantees the exactness can be calculated on the base of an auxiliary problem. The results are applied to problems with an arbitrary quadratic objective function, linear constraints and Boolean variables. This leads to a modified Lagrangean approach for the latter problems. In the general case, the penalty approach is compared with a direct application of results of global optimization to a modification of the initial problem.Keywords
This publication has 6 references indexed in Scilit:
- Penalty for zero–one integer equivalent problemMathematical Programming, 1982
- Zur effektiven Lösung von booleschen, quadratischen OptimierungsproblemenNumerische Mathematik, 1982
- A remark on multiplier methods for nonlinear programmingLecture Notes in Computer Science, 1976
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex ProgrammingSIAM Journal on Control, 1974
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969
- An Exact Potential Method for Constrained MaximaSIAM Journal on Numerical Analysis, 1969