Results 201 to 210 of about 124,509 (238)
Some of the next articles are maybe not open access.
Solving Bilevel Linear Programs Using Multiple Objective Linear Programming
Journal of Optimization Theory and Applications, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Glackin, J. +2 more
openaire +1 more source
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
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
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
Journal of the Operational Research Society, 1975
We consider here the problem of finding a non-negative solution to a set of linear equations which minimizes a bottleneck type objective. Two algorithms are described for the general problem and a single algorithm for the bottleneck transportation problem.
openaire +1 more source
We consider here the problem of finding a non-negative solution to a set of linear equations which minimizes a bottleneck type objective. Two algorithms are described for the general problem and a single algorithm for the bottleneck transportation problem.
openaire +1 more source
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 +1 more source
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 +1 more source
Linear Programming Under Uncertainty
Management Science, 1955The essential character of the general models under consideration is that activities are divided into two or more stages. The quantities of activities in the first stage are the only ones that are required to be determined; those in the second (or later) stages can not be determined in advance since they depend on the earlier stages and the random or ...
openaire +2 more sources
2023
The textbook contains practical tasks and theoretical information necessary to study the section "Linear programming". The presentation is accompanied by examples of solving typical tasks. The manual also contains examples of solving typical linear programming problems using the Mathcad Prime computer-aided design system and the Maple computer algebra ...
openaire +1 more source
The textbook contains practical tasks and theoretical information necessary to study the section "Linear programming". The presentation is accompanied by examples of solving typical tasks. The manual also contains examples of solving typical linear programming problems using the Mathcad Prime computer-aided design system and the Maple computer algebra ...
openaire +1 more source
Linear Optimisation (Linear Programming)
1990An optimisation problem is one requiring the determination of the optimal (maximum or minimum) value of a given function, called the objective function, subject to a set of stated restrictions, or constraints, placed on the variables concerned.
openaire +1 more source
2022
Since its conception in the 1940s in connection with planning activities of the military, linear programming (also called linear optimization) has come into wide use in industry and many other fields. In this book chapter, we introduce linear programming, and the graphical method, and study the linear programming duality and geometry. Then we study the
openaire +1 more source
Since its conception in the 1940s in connection with planning activities of the military, linear programming (also called linear optimization) has come into wide use in industry and many other fields. In this book chapter, we introduce linear programming, and the graphical method, and study the linear programming duality and geometry. Then we study the
openaire +1 more source