A Class of Linear Programming Problems Requiring a Large Number of Iterations.
V. KLEE (1965)
Numerische Mathematik
Similarity:
V. KLEE (1965)
Numerische Mathematik
Similarity:
A.A. GOLDSTEIN, B.R. KRIPKE (1964)
Numerische Mathematik
Similarity:
J. STOER (1963)
Numerische Mathematik
Similarity:
S.L. MEHNDIRATTA (1967)
Numerische Mathematik
Similarity:
J.B. ROSEN (1964)
Numerische Mathematik
Similarity:
L. BITTNER (1970/71)
Numerische Mathematik
Similarity:
L.P. Mavrides (1977)
Numerische Mathematik
Similarity:
E.W. DIJKSTRA (1960)
Numerische Mathematik
Similarity:
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Similarity:
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.
R. GORENFLO, Y. KOVETZ (1966)
Numerische Mathematik
Similarity:
J.F. BENDERS (1962/63)
Numerische Mathematik
Similarity: