Penalty for zero–one integer equivalent problem
From MaRDI portal
Publication:3328282
DOI10.1007/BF01585106zbMath0539.90074MaRDI QIDQ3328282
Bahman Kalantari, J. Ben Rosen
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Penalty formulation for zero-one nonlinear programming ⋮ New results on the equivalence between zero-one programming and continuous concave programming ⋮ Discrete linear bilevel programming problem ⋮ A gradient-based approach for discrete optimum design ⋮ Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation ⋮ 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 ⋮ Penalty parameter for linearly constrained 0--1 quadratic programming ⋮ 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 ⋮ An interior point algorithm to solve computationally difficult set covering problems ⋮ An exact penalty approach for solving a class of minimization problems with boolean variables ⋮ Analysis of penalty parameters in binary constrained extremum problems ⋮ Lagrangean duality for facial programs with applications to integer and complementarity problems ⋮ Exact penalty functions for nonlinear integer programming problems ⋮ On duality for Boolean programming ⋮ Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
Cites Work
