The following pages link to (Q3786267):
Displaying 17 items.
- The decomposition principle and algorithms for linear programming (Q806964) (← links)
- An explicit finite difference approach to the pricing problems of perpetual Bermudan options (Q842831) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- MINOS(IIS): Infeasibility analysis using MINOS (Q1317084) (← links)
- Load balancing in the parallel optimization of block-angular linear programs (Q1321661) (← links)
- Partitioning mathematical programs for parallel solution (Q1380936) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- The implementation of linear programming algorithms based on homotopies (Q1911465) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- An Implementation of Variable Upper Bounds via SUB Methodology (Q4008468) (← links)
- Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923) (← links)
- The D<sub>L</sub>P decision support system and its extension to stochastic programming<sup>∗</sup> (Q4503115) (← links)
- The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
- LOQO user's manual — version 3.10 (Q4504790) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- Dual simplex algorithm with implicit representation of variable upper bounds (Q4836772) (← links)
