A computationally stable solution algorithm for linear programs
From MaRDI portal
Publication:2372034
Recommendations
Cites work
- A combined gradient and feasible direction pivotal solution algorithm for general LP.
- A comparison of the primal‐simplex and complementary pivot methods for linear programming
- A complete algorithm for linear fractional programs
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
- A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
- A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
- A turnpike property of optimal programs for a class of simple linear models of production
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- Affine geometric method for linear programs
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy
- An artificial-free simplex-type algorithm for general LP models
- An improved initial basis for the simplex algorithm
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- Distribution-routes stability analysis of the transportation problem
- Frontiers of Stochastically Nondominated Portfolios
- scientific article; zbMATH DE number 4135711 (Why is no real title available?)
- scientific article; zbMATH DE number 1185604 (Why is no real title available?)
- scientific article; zbMATH DE number 734886 (Why is no real title available?)
- scientific article; zbMATH DE number 1156645 (Why is no real title available?)
- scientific article; zbMATH DE number 1161278 (Why is no real title available?)
- scientific article; zbMATH DE number 1931454 (Why is no real title available?)
- scientific article; zbMATH DE number 1472107 (Why is no real title available?)
- scientific article; zbMATH DE number 840699 (Why is no real title available?)
- scientific article; zbMATH DE number 1444288 (Why is no real title available?)
- scientific article; zbMATH DE number 3356432 (Why is no real title available?)
- Making progress during a stall in the simplex algorithm
- Managing cost uncertainties in transportation and assignment problems
- On the more-for-less paradoxical situations in linear programs: A parametric optimization approach
- Perturbation analysis of general LP models: A unified approach to sensitivity, parametric, tolerance, and more-for-less analysis
- Pivot rules for linear programming: A survey on recent theoretical developments
- Postoptimality Analyses of the Transportation Problem
- Steepest-edge simplex algorithms for linear programming
- The pivot and probe algorithm for solving a linear program
Cited in
(11)- A two-phase support method for solving linear programs: numerical experiments
- The big-M method with the numerical infinite M
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- An improved initial basis for the simplex algorithm
- On computing a stable least squares solution to the linear programming problem.
- Calibrating cross-training to meet demand mix variation and employee absence
- scientific article; zbMATH DE number 4028839 (Why is no real title available?)
- scientific article; zbMATH DE number 47963 (Why is no real title available?)
- scientific article; zbMATH DE number 59369 (Why is no real title available?)
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
- scientific article; zbMATH DE number 5182668 (Why is no real title available?)
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)
