A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs

DOI10.1016/J.AMC.2006.10.020MaRDI QIDQ2371471zbMATH OpenOpenAlexFDO

Authors H. Arsham

Publication date 4 July 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.10.020

zbMATH Keywords

linear programmingnumerical examplesartificial-freefeasible direction methodpivoting algorithmfull gradient simplex algorithmadvance basissub-gardient direction method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region
• scientific article; zbMATH DE number 5182668
• On gradient simplex methods for linear programs
• A computationally stable solution algorithm for linear programs
• An artificial-free simplex-type algorithm for general LP models

Cites work

• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3528040 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• A conditional logic approach for strengthening mixed 0-1 linear programs
• A new efficient primal dual simplex algorithm
• A new polynomial-time algorithm for linear programming
• A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
• Affine geometric method for linear programs
• An artificial-free simplex-type algorithm for general LP models
• An efficient simplex type algorithm for sparse and dense linear programs.
• An improved initial basis for the simplex algorithm
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs
• Cutting plane method for multiple objective stochastic integer linear programming
• Distribution-routes stability analysis of the transportation problem
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
• Making progress during a stall in the simplex algorithm
• Managing cost uncertainties in transportation and assignment problems
• On the choice of the pivot columns of the simplex-method: Gradient criteria
• Optimizing a linear function over an integer efficient set
• Pivot and shift -- a mixed integer programming heuristic
• Pivot rules for linear programming: A survey on recent theoretical developments
• Random edge can be exponential on abstract cubes
• Recovering an optimal LP basis from an optimal dual solution
• The Cholesky factorization in interior point methods
• The sagitta method for solving linear programs

Cited in

(7)

• An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Exterior point simplex-type algorithms for linear and network optimization problems
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
• A hybrid direction algorithm for solving linear programs

Describes a project that uses

Uses Software

• MarPlex

This page was built for publication: A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs

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