Pages that link to "Item:Q2275570"

The following pages link to Klee-Minty's LP and upper bounds for Dantzig's simplex method (Q2275570):

Displaying 9 items.

• On the number of solutions generated by the dual simplex method (Q439907) (← links)
• Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
• Efficient computation of a canonical form for a matrix with the generalized P-property (Q747763) (← links)
• A bound for the number of different basic solutions generated by the simplex method (Q1942281) (← links)
• A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
• An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492) (← links)
• On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)
• LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144758) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)