scientific article; zbMATH DE number 1960976

zbMATH Open1069.90538MaRDI QIDQ4415862FDOQ4415862

Authors: Fu-Rong Lin, Dongyi Chen 

Publication date: 7 August 2003

Title of this publication is not available (Why is that?)

Recommendations

• Practical finite pivoting rules for the simplex method
• A largest-distance pivot rule for the simplex algorithm
• scientific article; zbMATH DE number 3904322
• Pivot rules for linear programming: A survey on recent theoretical developments
• Steepest-edge simplex algorithms for linear programming

zbMATH Keywords

linear programmingnumber of stepssimplex methodpivoting rule

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Cited In (11)

• Title not available (Why is that?)
• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
• Optimal pivot path of the simplex method for linear programming based on reinforcement learning
• A largest-distance pivot rule for the simplex algorithm
• Experiments with external pivoting
• On Simplex Pivoting Rules and Complexity Theory
• Title not available (Why is that?)
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
• On simplex method with most-obtuse-angle rule and cosine rule
• Title not available (Why is that?)

This page was built for publication:

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