Exact penalty function and asymptotic strong nonlinear duality in integer programming
From MaRDI portal
Publication:1780321
Recommendations
- General exact penalty functions in integer programming
- Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
- scientific article; zbMATH DE number 2135425
- scientific article; zbMATH DE number 2177407
- Exact penalty functions for nonlinear integer programming problems
Cites work
- An exact penalty function approach for nonlinear integer programming problems
- Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- Value-estimation function method for constrained global optimization
- Zero duality gap for a class of nonconvex optimization problems
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
Cited in
(5)- scientific article; zbMATH DE number 2177407 (Why is no real title available?)
- General exact penalty functions in integer programming
- Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
- Logarithmic-exponential penalty formulation for integer programming
- scientific article; zbMATH DE number 2135425 (Why is no real title available?)
This page was built for publication: Exact penalty function and asymptotic strong nonlinear duality in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780321)
