Results 241 to 250 of about 4,002,335 (287)
Some of the next articles are maybe not open access.
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 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
Presolving in linear programming
Mathematical Programming, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erling D. Andersen, Knud D. Andersen
openaire +1 more source
A linear programming approach for linear programs with probabilistic constraints
European Journal of Operational Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Linearization by Program Transformation
2004We identify a restricted class of terms of the lambda calculus, here called weak linear, that includes the linear lambda-terms keeping their good properties of strong normalization, non-duplicating reductions and typability in polynomial time. The advantage of this class over the linear lambda-calculus is the possibility of transforming general terms ...
Sandra Alves, Mário Florido
openaire +2 more sources
Gigaflops in linear programming
Operations Research Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Irvin J. Lustig, Edward Rothberg
openaire +2 more sources
Linearizing Geometric Programs
SIAM Review, 1970A geometric program concerns minimizing a function subject to constraint functions, all functions being of posynomial form. In this paper the posynomial functions are condensed to monomial form by the use of the inequality reducing a weighted arithmetic mean to a weighted geometric mean.
openaire +2 more sources
Linear multiplicative programming
Mathematical Programming, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hiroshi Konno, Takahito Kuno
openaire +3 more sources
Computers & Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Mathematical Programming, 1981
This paper treats entropy constrained linear programs from modelling as well as computational aspects. The optimal solutions to linear programs with one additional entropy constraint are expressed in terms of Lagrange-multipliers. Conditions for uniqueness are given. Sensitivity and duality are studied. The Newton—Kantorovich method is used to obtain a
openaire +3 more sources
This paper treats entropy constrained linear programs from modelling as well as computational aspects. The optimal solutions to linear programs with one additional entropy constraint are expressed in terms of Lagrange-multipliers. Conditions for uniqueness are given. Sensitivity and duality are studied. The Newton—Kantorovich method is used to obtain a
openaire +3 more sources
Bicriterion linear programming
Computers & Operations Research, 1977Abstract 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