Over the years researchers have proposed procedures to reduce the gap in the surrogate constraint. Our aim is to review models that close the surrogate duality gap. Five research streams that provide procedures with zero duality gap are identified and discussed. In each research stream, we will ...
To compute tighter bounds of the primal problem, the cutting plane method was used to solve the surrogate dual problem, where the surrogate relaxation problem was solved by the 0鈥 1 linearization method. The domain cut technique was employed to eliminate the duality gap and thus to guarantee ...
网络共轭对偶 网络释义 1. 共轭对偶 共轭对偶问题,conjugate dual... ... ) conjugate duality 共轭对偶 )surrogate dual共轭对偶) conjugate dual 共轭对偶 ... www.dictall.com|基于 1 个网页 例句
Overlooking such information can produce shortcomings in the research in which a non-zero duality gap is observed. We propose theorems to address the shortcomings and report results regarding implementation issues.doi:10.1016/j.apm.2011.11.051Bahram Alidaee...
Nakagawa has recently proposed an improved surrogate constraint (ISC) method that can close the surrogate duality gap and hence provide optimal solutions to problems which previously could not be solved due to the size of their surrogate duality gap. By applying this ISC method to multidimensional ...
对偶间隙The valid inequalities is applied to surrogate duality in integer programs.The idea for closing surrogate dual gap is presented.Numerical example shows that the methods given in the paper is effecitive on stronger bounding properties.
But when there exists a surrogate duality gap between the translated one-dimensional problem and the original multidimensional problem, the optimal solution to the surrogate problem is not optimal with respect to the original problem.Yuji Nakagawa...
surrogate dualityduality gapequality constraintsWe consider linear programming problems with some equality constraints. For such problems, surrogate relaxation formulations relaxing equality constraints existwith zero primal-dual gap both when all variables are restricted to be integers and when no variable ...
The dual techniques, however, often end up with a duality gap and fail to identify the optimal solution of the primal integer optimization prob...Gavish, B., F. Glover, and H. Pirkul (1991) "Surrogate Constraints in Integer Programming," Journal of Information & Optimization Sciences, 12(...
Also, we determine the surrogate dual problems and surrogate Lagrangians for various optimization problems. For norm minimization on linear manifolds, we find an optimal perturbation for pseudo-duality, i.e., which yields the gap 0.doi:10.1016/0022-247X(84)90277-4Ivan Singer...