Results 231 to 240 of about 3,786,566 (280)

Linear multiplicative programming

Mathematical Programming, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hiroshi Konno, Takahito Kuno
openaire   +3 more sources

Asymptotic Linear Programming

Operations Research, 1973
This paper studies the linear programming problem in which all coefficients (even those of the stipulations matrix) are rational functions of a single parameter t called “time,” and provides an algorithm that can solve problems of the following two types: (1) Steady-state behavior [the algorithm can be used to determine the functional form x(t) of the
openaire   +2 more sources

Algebraic Linear Programming

Mathematics of Operations Research, 1982
The algebraic approach to network-flow problems discussed by Burkard and Zimmermann (Burkard, R. E., U. Zimmermann. 1977. Weakly admissible transformations for solving algebraic assignment and transportation problems. Balinski and Padperg, eds. Report 1977-8, Mathematische Institut der Universitat Zu Koln (1977). To appear in Math. Prog.
openaire   +2 more sources

The Discovery of Linear Programming

IEEE Annals of the History of Computing, 1984
Around 1940, linear programming was an idea whose time had come. Accordingly, it was discovered three times, independently, between 1939 and 1947, but each time in a somewhat different form dictated by the special circumstances of that discovery. The first discovery was by L. V. Kantorovich, a Soviet citizen, the second was by T. C.
openaire   +3 more sources

A linear programming approach for linear programs with probabilistic constraints

European Journal of Operational Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Gigaflops in linear programming

Operations Research Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Irvin J. Lustig, Edward Rothberg
openaire   +2 more sources

Multiparametric Linear Programming

Management Science, 1972
The multiparametric linear programming (MLP) problem for the right-hand sides (RHS) is to maximize z = cTx subject to Ax = b(λ), x ≧ 0, where b(λ) be expressed in the form [Formula: see text] where F is a matrix of constant coefficients, and λ is a vector-parameter.
Tomas Gal, Josef Nedoma
openaire   +2 more sources

Bicriterion linear programming

Computers & Operations Research, 1977
Abstract Basically leaning on the concept of “best” compromise, the technique seeks the optimal solution by fair relaxations of the objectives commensurate with their degrees of importance until the optimum feasible compromise is reached. The concept is made operational by deriving a linear constraint (referred to as the compromise constraint) to be ...
Pakorn Adulbhan, Mario T. Tabucanon
openaire   +2 more sources

Quantified linear programming [PDF]

, 2015
In many real world problems, dealing with uncertainty is a significant challenge for mathematical programming and related areas, and typically, standard (mixed-integer) linear programming formulations are not well suited to model such problems. However, a powerful way to express uncertainty or adversarial situations is through the use of quantified ...
openaire   +1 more source

Bilevel linear programming

Computers & Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources