A method of solving the general problem of linear programming
From MaRDI portal
Recommendations
Cited in
(29)- scientific article; zbMATH DE number 4185389 (Why is no real title available?)
- scientific article; zbMATH DE number 4142889 (Why is no real title available?)
- scientific article; zbMATH DE number 4033490 (Why is no real title available?)
- scientific article; zbMATH DE number 2047294 (Why is no real title available?)
- scientific article; zbMATH DE number 1504438 (Why is no real title available?)
- The Criss-Cross Method for Solving Linear Programming Problems
- The sagitta method for solving linear programs
- scientific article; zbMATH DE number 1855677 (Why is no real title available?)
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- A direct heuristic algorithm for linear programming
- scientific article; zbMATH DE number 4016596 (Why is no real title available?)
- scientific article; zbMATH DE number 4172286 (Why is no real title available?)
- scientific article; zbMATH DE number 4093174 (Why is no real title available?)
- scientific article; zbMATH DE number 4072707 (Why is no real title available?)
- scientific article; zbMATH DE number 3148889 (Why is no real title available?)
- A generalized inverse method for asymptotic linear programming
- A canonical form for pencils of matrices with applications to asymptotic linear programs
- Un algorithme pour la résolution du programme linéaire général
- scientific article; zbMATH DE number 3867084 (Why is no real title available?)
- A dual method for solving the canonical linear programming problem
- scientific article; zbMATH DE number 4156204 (Why is no real title available?)
- Formulation of linear problems and solution by a universal machine
- scientific article; zbMATH DE number 980220 (Why is no real title available?)
- scientific article; zbMATH DE number 3898608 (Why is no real title available?)
- Description of the optimal solution set of the linear programming problem and the dimension formula
- Method for sequential activation of limitations in linear programming
- The generalized simplex method
- The problem of convex programming with linear constraints
- scientific article; zbMATH DE number 4137527 (Why is no real title available?)
This page was built for publication: A method of solving the general problem of linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082571)
