Pages that link to "Item:Q4323674"
From MaRDI portal
The following pages link to Implementing the simplex method for the Optimization Subroutine Library (Q4323674):
Displaying 15 items.
- Parallel algorithm for solving linear programming problem under conditions of incomplete data (Q612150) (← links)
- Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972) (← links)
- A new neural network for solving linear programming problems (Q1268155) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- An interactive graphic presentation for multiobjective linear programming. (Q1855057) (← links)
- A numerically exact implementation of the simplex method (Q1904700) (← links)
- Presolving in linear programming (Q1914076) (← links)
- An advanced macro spreadsheet program for the simplex method (Q1968596) (← links)
- Modified simplex optimization program (Q4292260) (← links)
- A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗ (Q4820092) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713879) (← links)