Pages that link to "Item:Q1264089"
From MaRDI portal
The following pages link to A practical anti-cycling procedure for linearly constrained optimization (Q1264089):
Displaying 50 items.
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- A linear programming decomposition focusing on the span of the nondegenerate columns (Q319585) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- A factorization with update procedures for a KKT matrix arising in direct optimal control (Q384809) (← links)
- New crash procedures for large systems of linear constraints (Q584077) (← links)
- Limit cycles in local preference optimization (Q684762) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Efficient implementation of an active set algorithm for large-scale portfolio selection (Q925841) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Resolving degeneracy in quadratic programming (Q1312769) (← links)
- On degeneracy in linear programming and related problems (Q1312772) (← links)
- A strictly improving linear programming Phase I algorithm (Q1312775) (← links)
- A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
- The simplex algorithm with a new primal and dual pivot rule (Q1342283) (← links)
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Parallel search paths for the simplex algorithm (Q1642812) (← links)
- An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system (Q1751754) (← links)
- Cycling in linear programming problems (Q1765542) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- An efficient linear programming algorithm for combined heat and power production. (Q1810497) (← links)
- Geometry of the Gass-Saaty parametric cost LP algorithm (Q1825128) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
- A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
- Fast quantum subroutines for the simplex method (Q2061891) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- An efficient linear model and optimisation algorithm for multi-site combined heat and power production (Q2569054) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis (Q2802253) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Complementarity framework for non linear dynamic analysis of skeletal structures with softening plastic hinges (Q2880242) (← links)
- Solving Multiscale Linear Programs Using the Simplex Method in Quadruple Precision (Q3462312) (← links)
- (Q3481484) (← links)
- A validation and verification tool for global optimization solvers (Q3598649) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
