Zero duality gap in integer programming: P-norm surrogate constraint method
From MaRDI portal
Publication:1807931
DOI10.1016/S0167-6377(99)00039-5zbMATH Open0973.90051DBLPjournals/orl/Li99WikidataQ57445554 ScholiaQ57445554MaRDI QIDQ1807931FDOQ1807931
Authors: Duan Li 
Publication date: 24 November 1999
Published in: Operations Research Letters (Search for Journal in Brave)
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
integer programmingduality gapsaddle pointsurrogate constraint method\(p\)-norm surrogate constraint method
Cites Work
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Surrogate Mathematical Programming
- Zero duality gap for a class of nonconvex optimization problems
- Quasi-Convex Programming
- Some relationships between lagrangian and surrogate duality in integer programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- Surrogate Constraints in Integer Programming
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)
