dual simplex method
Description: A linear programming method that uses simplex pivots to restore primal feasibility while preserving dual feasibility.
Primary topic: Optimization and Mathematical Programming (33%)
OpenAlex ID: keywords/dual-simplex-method
