Pages that link to "Item:Q2371471"

The following pages link to A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs (Q2371471):

Displaying 6 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
• An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region (Q1635378) (← links)
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
• A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments (Q5356997) (← links)
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154) (← links)