Results 301 to 310 of about 10,510,472 (349)
Some of the next articles are maybe not open access.
Bottleneck Linear Programming [PDF]
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
Operational Research, 1973
This note formulates a convex mathematical programming problem in which the usual definition of the feasible region is replaced by a significantly different strategy.
A. Soyster
semanticscholar +1 more source
This note formulates a convex mathematical programming problem in which the usual definition of the feasible region is replaced by a significantly different strategy.
A. Soyster
semanticscholar +1 more source
, 1986
We describe how several optimization problems can be rapidly solved by highly interconnected networks of simple analog processors. Analog-to-digital (A/D) conversion was considered as a simple optimization problem, and an A/D converter of novel ...
D. Tank, J. Hopfield
semanticscholar +1 more source
We describe how several optimization problems can be rapidly solved by highly interconnected networks of simple analog processors. Analog-to-digital (A/D) conversion was considered as a simple optimization problem, and an A/D converter of novel ...
D. Tank, J. Hopfield
semanticscholar +1 more source
A Linear Programming Approach to the Cutting-Stock Problem
, 1961The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut from given stock lengths of given cost.
P. Gilmore, R. Gomory
semanticscholar +1 more source
Covering Linear Programming with Violations
INFORMS journal on computing, 2014We consider a class of linear programs involving a set of covering constraints of which at most k are allowed to be violated. We show that this covering linear program with violation is strongly NP-hard.
Feng Qiu +3 more
semanticscholar +1 more source
Presolving in linear programming [PDF]
Mathematical Programming, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erling D. Andersen, Knud D. Andersen
openaire +1 more source
Linear Programming Under Uncertainty
Management Sciences, 2004(This article originally appeared in Management Science, April-July 1955, Volume 1, Numbers 3 and 4, pp. 197-206, published by The Institute of Management Sciences.)
G. Dantzig
semanticscholar +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 +2 more sources
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 +2 more sources