Pages that link to "Item:Q797493"
From MaRDI portal
The following pages link to A feasible direction method for linear programming (Q797493):
Displaying 18 items.
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- Solving fully fuzzy matrix equations (Q345498) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- Experiments with external pivoting (Q909578) (← links)
- A unified approach to the feasible direction methods for nonlinear programming with linear constraints (Q1058461) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- Pure adaptive search in Monte Carlo optimization (Q1119467) (← links)
- Computational behavior of a feasible direction method for linear programming (Q1119474) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- A steepest feasible direction extension of the simplex method (Q2050249) (← links)
- On linear multiplicative programming. (Q2468549) (← links)
- (Q3807002) (← links)
- The method of feasible directions for minimax problems (Q4327954) (← links)
- (Q4347843) (← links)
- Global pricing and feasible directions in linear programming (Q6606655) (← links)
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154) (← links)