Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
From MaRDI portal
Publication:5928425
DOI10.1023/A:1008325116400zbMath1052.90047OpenAlexW1524977140WikidataQ57445546 ScholiaQ57445546MaRDI QIDQ5928425
No author found.
Publication date: 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008325116400
Related Items (17)
Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Unnamed Item ⋮ An exact algorithm for cost minimization in series reliability systems with multiple component choices ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Discrete filled function method for discrete global optimization ⋮ Exact penalty function and asymptotic strong nonlinear duality in integer programming ⋮ Towards strong duality in integer programming ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems ⋮ Strong duality in optimization: shifted power reformulation ⋮ Distance confined path problem and separable integer programming ⋮ Generalized nonlinear Lagrangian formulation for bounded integer programming ⋮ A nonlinear Lagrangian dual for integer programming
This page was built for publication: Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
