Zero duality gap in integer programming: P-norm surrogate constraint method
From MaRDI portal
Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
Recommendations
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Publication:4206317
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate duality in a branch-and-bound procedure for integer programming
- A result in surrogate duality for certain integer programming problems
- scientific article; zbMATH DE number 4039640
- On zero duality gap in nonconvex quadratic programming problems
- On the surrogate constraint and the core of a linear mixed-integer 0–1 program with few constraints
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3327467 (Why is no real title available?)
- Quasi-Convex Programming
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraints in Integer Programming
- Surrogate Mathematical Programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Zero duality gap for a class of nonconvex optimization problems
Cited in
(11)- On the existence of duality gaps for mixed integer programming
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Comment on A nonlinear Lagrangian dual for integer programming.
- Generalized nonlinear Lagrangian formulation for bounded integer programming
- Exact penalty function and asymptotic strong nonlinear duality in integer programming
- Surrogate-RLT cuts for zero-one integer programs
- A nonlinear Lagrangian dual for integer programming
- Distance confined path problem and separable integer programming
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Strong duality in optimization: shifted power reformulation
- Towards strong duality in integer programming
This page was built for publication: Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807931)
