A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method

DOI10.37190/ORD2402010MaRDI QIDQ6660154

Biressaw Chali Wolde, Torbjörn Larsson

Publication date: 10 January 2025

Published in: Operations Research and Decisions (Search for Journal in Brave)

zbMATH Keywords

linear programmingsimplex methodfeasible directionexternal pivotingsteepest edge

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A feasible direction method for linear programming
• Experiments with external pivoting
• Computational behavior of a feasible direction method for linear programming
• Steepest-edge simplex algorithms for linear programming
• Computational techniques of the simplex method
• A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
• A steepest feasible direction extension of the simplex method
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
• On scaling linear programs—some experimental results
• A practicable steepest-edge simplex algorithm
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Nonlinear Programming
• Pivot selection methods of the Devex LP code

This page was built for publication: A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method

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