
doi: 10.1007/bf01956855
A method for finding approximate solutions for continuous linear programming problems is suggested. The required conditions to be met are: a) the matrix associated with the integrals in the constraints is constant; b) all functions involved are of bounded variation; c) the matrices involved satisfy certain boundedness conditions, and d) there exist feasible solutions.
Numerical mathematical programming methods, Linear programming
Numerical mathematical programming methods, Linear programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 18 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
