Penalty for zero–one integer equivalent problem

DOI10.1007/BF01585106zbMATH Open0539.90074MaRDI QIDQ3328282FDOQ3328282

Authors Bahman Kalantari, J. B. Rosen

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

concave quadratic penalty function problemequivalent programslower penalty bound

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Recommendations

• Penalty formulation for zero-one nonlinear programming
• Penalty parameter for linearly constrained 0--1 quadratic programming
• Exact penalty functions for nonlinear integer programming problems
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• New results on the equivalence between zero-one programming and continuous concave programming

Cites work

• A Successive Underestimation Method for Concave Minimization Problems
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints

Cited in

(21)

• On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
• An exact penalty function approach for nonlinear integer programming problems
• Exact penalty functions for nonlinear integer programming problems
• Convergence of a continuous approach for zero-one programming problems
• New results on the equivalence between zero-one programming and continuous concave programming
• On duality for Boolean programming
• Continuous reformulations for zero-one programming problems
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• Lagrangean duality for facial programs with applications to integer and complementarity problems
• Penalty formulation for zero-one nonlinear programming
• Discrete linear bilevel programming problem
• Penalty parameter for linearly constrained 0--1 quadratic programming
• Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation
• A gradient-based approach for discrete optimum design
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• An exact penalty global optimization approach for mixed-integer programming problems
• Analysis of penalty parameters in binary constrained extremum problems
• Logarithmic-exponential penalty formulation for integer programming
• A smoothing method for zero--one constrained extremum problems
• An exact penalty approach for solving a class of minimization problems with boolean variables
• An interior point algorithm to solve computationally difficult set covering problems

This page was built for publication: Penalty for zero–one integer equivalent problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328282)