AbstractThe algorithm determines a non-iteration procedure for computing the optimal solution of a linear programming problem. We consider approximating system of linear equations to determine the optimal basis variables of the linear programming problem. The usefulness of the algorithm is illustrated by a numerical example
Cover title.Includes bibliographical references (p. 18-20).Research supported by the Army Research O...
summary:An algorithm is presented in ALGOL 60 which automatizes the heuristical work of an investiga...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
AbstractThe algorithm determines a non-iteration procedure for computing the optimal solution of a l...
This report presents an algorithm that finds an -feasible solution relatively to some constraints ...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
Caption title. "September 1988."Includes bibliographical references.This research is partially suppo...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
AbstractUsow's algorithm for solving the discrete linear L1 approximation problem is generalized so ...
We propose a simple O([n5/logn]L)O([n5/logn]L) algorithm for linear programming feasibility, that ca...
AbstractWe present a new linear-programming algorithm that is simple, effective, fully parallelizabl...
This thesis examines methods for the solution of a number of approximation problems which include m...
In this paper, we focus on a treatment of a linear programming problem with an interval objective fu...
summary:An algorithm is presented in ALGOL 60 which automatizes the heuristical work of an investiga...
A new algorithm for the ℓ∞ solution of overdetermined linear systems is given. The algorithm is base...
Cover title.Includes bibliographical references (p. 18-20).Research supported by the Army Research O...
summary:An algorithm is presented in ALGOL 60 which automatizes the heuristical work of an investiga...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
AbstractThe algorithm determines a non-iteration procedure for computing the optimal solution of a l...
This report presents an algorithm that finds an -feasible solution relatively to some constraints ...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
Caption title. "September 1988."Includes bibliographical references.This research is partially suppo...
This article presents an algorithm that finds an e-feasible solution relatively to some constraints ...
AbstractUsow's algorithm for solving the discrete linear L1 approximation problem is generalized so ...
We propose a simple O([n5/logn]L)O([n5/logn]L) algorithm for linear programming feasibility, that ca...
AbstractWe present a new linear-programming algorithm that is simple, effective, fully parallelizabl...
This thesis examines methods for the solution of a number of approximation problems which include m...
In this paper, we focus on a treatment of a linear programming problem with an interval objective fu...
summary:An algorithm is presented in ALGOL 60 which automatizes the heuristical work of an investiga...
A new algorithm for the ℓ∞ solution of overdetermined linear systems is given. The algorithm is base...
Cover title.Includes bibliographical references (p. 18-20).Research supported by the Army Research O...
summary:An algorithm is presented in ALGOL 60 which automatizes the heuristical work of an investiga...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
DOI
Add to ORKG