Gomory's method based on the objective equivalent face technique
- 23 Downloads
This paper discusses a re-examination of dual methods based on Gomory's cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable to decide the search direction and stepsize. Meanwhile, we adopt the current equivalent face technique so that lattices are found in the discrete integral face and stronger valid inequalities are acquired easily.
Key wordsinteger programming Gomory's cutting plane dual gap primal and dual algorithm
CLC numberO 221.4
Unable to display preview. Download preview PDF.
- Nemhauser G L, Wolsey L A.Integer and Combinationrial Optimization[M]. New York: Wiley, 1988.Google Scholar
- Capprara A, Fischetti M. Branch-and-Cut Algorithms[C]// Dell's Amico M, Maffioli F, Martello S eds.Annotated Bibliographices in Combinatorial Optimization. New York: Wiley, 1997: 45–64.Google Scholar
- Yan Zizong, Fei Pusheng. Current Equivalent Face Algorithm for Linear Programming[J].Numer Math & Appl, 2005,1: 49–58.Google Scholar