A computationally stable solution algorithm for linear programs
From MaRDI portal
Publication:2372034
DOI10.1016/J.AMC.2006.11.031zbMATH Open1119.65051OpenAlexW2161535260MaRDI QIDQ2372034FDOQ2372034
Authors: H. Arsham 
Publication date: 10 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.11.031
Recommendations
numerical examplessimplex methodpivot algorithmartificial-freeadvance basisbig-M-free methodcomputational linear programming
Cites Work
- An improved initial basis for the simplex algorithm
- Pivot rules for linear programming: A survey on recent theoretical developments
- A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
- Steepest-edge simplex algorithms for linear programming
- Title not available (Why is that?)
- Postoptimality Analyses of the Transportation Problem
- Frontiers of Stochastically Nondominated Portfolios
- An artificial-free simplex-type algorithm for general LP models
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
- Title not available (Why is that?)
- Managing cost uncertainties in transportation and assignment problems
- A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
- Title not available (Why is that?)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- A complete algorithm for linear fractional programs
- The pivot and probe algorithm for solving a linear program
- Making progress during a stall in the simplex algorithm
- A comparison of the primal‐simplex and complementary pivot methods for linear programming
- Affine geometric method for linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy
- Distribution-routes stability analysis of the transportation problem
- A turnpike property of optimal programs for a class of simple linear models of production
- Perturbation analysis of general LP models: A unified approach to sensitivity, parametric, tolerance, and more-for-less analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combined gradient and feasible direction pivotal solution algorithm for general LP.
- Title not available (Why is that?)
- On the more-for-less paradoxical situations in linear programs: A parametric optimization approach
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Title not available (Why is that?)
- A two-phase support method for solving linear programs: numerical experiments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calibrating cross-training to meet demand mix variation and employee absence
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
- An improved initial basis for the simplex algorithm
- On computing a stable least squares solution to the linear programming problem.
Uses Software
This page was built for publication: A computationally stable solution algorithm for linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372034)
