Pages that link to "Item:Q1138478"
From MaRDI portal
The following pages link to A penalty linear programming method using reduced-gradient basis-exchange techniques (Q1138478):
Displaying 11 items.
- A method of synthesis of linear discriminant function in the case of nonseparability (Q793475) (← links)
- Degeneracy in the presence of roundoff errors (Q1105984) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- Linear programming via least squares (Q1114313) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- A network penalty method (Q1174423) (← links)
- Solving linear programming problems via linear minimax problems (Q1180710) (← links)
- Piecewise-linear pathways to the optimal solution set in linear programming (Q1357530) (← links)
- Automatic decrease of the penalty parameter in exact penalty function methods (Q1388859) (← links)
- Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
- A simplex algorithm for piecewise-linear programming I: Derivation and proof (Q3703668) (← links)
