A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
DOI10.1016/J.AMC.2006.10.020zbMATH Open1114.65327OpenAlexW2127571802MaRDI QIDQ2371471FDOQ2371471
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
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
linear programmingnumerical examplesartificial-freefeasible direction methodpivoting algorithmfull gradient simplex algorithmadvance basissub-gardient direction method
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- An improved initial basis for the simplex algorithm
- Title not available (Why is that?)
- Pivot rules for linear programming: A survey on recent theoretical developments
- The Cholesky factorization in interior point methods
- A new efficient primal dual simplex algorithm
- Optimizing a linear function over an integer efficient set
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
- An artificial-free simplex-type algorithm for general LP models
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- An efficient simplex type algorithm for sparse and dense linear programs.
- Pivot and shift -- a mixed integer programming heuristic
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- Recovering an optimal LP basis from an optimal dual solution
- The sagitta method for solving linear programs
- Title not available (Why is that?)
- Managing cost uncertainties in transportation and assignment problems
- Random edge can be exponential on abstract cubes
- Cutting plane method for multiple objective stochastic integer linear programming
- On the choice of the pivot columns of the simplex-method: Gradient criteria
- Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs
- A conditional logic approach for strengthening mixed 0-1 linear programs
- 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
- Affine geometric method for linear programs
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Distribution-routes stability analysis of the transportation problem
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
- A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
- A hybrid direction algorithm for solving linear programs
Uses Software
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)
