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)

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

zbMATH Keywords

concave quadratic penalty function problemequivalent programslower penalty bound

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

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