Primal-dual simplex method for shooting

DOI10.1016/J.ENDM.2010.05.091MaRDI QIDQ2883641zbMATH OpenOpenAlexFDO

Authors Wenwei Cao, Sangho Shim, Ellis L. Johnson

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.091

zbMATH Keywords

cutting plane algorithmprimal-dual simplex methodcyclic group problem

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• Cyclic group blocking polyhedra
• Two algorithms to get strong Gomory cuts
• A primal-dual cutting-plane algorithm for all-integer programming
• A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
• Computational results with a primal-dual subproblem simplex method

Cites work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• Corner polyhedra and their connection with cutting planes
• Some polyhedra related to combinatorial problems

Cited in

(2)

• Cyclic group blocking polyhedra
• Modifying the shooting model for solving equilibrium problems

This page was built for publication: Primal-dual simplex method for shooting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883641)