Pages that link to "Item:Q4196237"
From MaRDI portal
The following pages link to New Finite Pivoting Rules for the Simplex Method (Q4196237):
Displayed 37 items.
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Multiparametric demand transportation problem (Q1604061) (← links)
- New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
- Measuring inconsistency (Q1610611) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Courtship and linear programming (Q1805218) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties (Q1813345) (← links)
- Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656) (← links)
- A simple direct cosine simplex algorithm (Q2391301) (← links)
- Unimodular modules (Q2433702) (← links)
- Quantifier elimination in automatic loop parallelization (Q2457396) (← links)
- A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- On finding and detecting efficient assignments in the case of multiple inputs and outputs (Q3568413) (← links)
- Dealing with degeneracy in reduced gradient algorithms (Q3691433) (← links)
- A convergent criss-cross method (Q3703581) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- A note on degeneracy in linear programming (Q3730338) (← links)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (Q3755229) (← links)
- The Stable Evaluation of Multivariate Simplex Splines (Q3812703) (← links)
- Primal transportation and transshipment algorithms (Q3863694) (← links)
- A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
- Least-index resolution of degeneracy in quadratic programming (Q3902831) (← links)
- Linear max-min programming (Q3905079) (← links)
- (Q3978055) (← links)
- A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- A new proof for the criss-cross method for quadratic programming (Q4327956) (← links)
- Solution procedures for multi-objective markov decision processes (Q4389873) (← links)
- Variants of the Hungarian method for solving linear programming problems (Q4729607) (← links)
- The pivot and probe algorithm for solving a linear program (Q5184665) (← links)
- Modification and implementation of two-phase simplex method (Q5190728) (← links)
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution (Q5202511) (← links)