Journal Article10.1287/MNSC.2.2.131
Recent advances in linear programming
TL;DR: Three topics have been selected (in three sections that follow) which have recently come into prominence: uncertainty, combinatorial problems, and large scale systems.
read more
Abstract: As interest grows rapidly in industry on the potentialities of mathematical programming techniques, it appears worthwhile to have a paper devoted to some of the more promising developments which may speed up the transition from interest to use. Three topics have been selected (in three sections that follow) which have recently come into prominence: uncertainty, combinatorial problems, and large scale systems. The reader will find in the course of their discussions that a survey—though perhaps not a systematic survey—has been made of current techniques in the linear programming field.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming
TL;DR: Extensions to an algebraic modeling language that encompass piecewise-linear, network and related structures are described that make models faster to translate as well as to solve and permit a “column-wise” formulation of the constraints as an alternative to the “row-wise" formulation most often associated with algebraic languages.
Life-Cycle Asset Allocation and Consumption Using Stochastic Linear Programming
TL;DR: In this article, the problem of optimal consumption and (strategic) asset allocation of an investor with uncertain lifetime is solved using a multi-stage stochastic linear programming (SLP) model to be able to generalize the closed-form solution obtained by Richard.
Safety-First Rules under Chance-Constrained Linear Programming
TL;DR: The analysis attempts to define relatively distribution-free tolerance levels and the incidence of nonnormality in chance-constrained linear programming.
30
An Approach to Linear Programming under Uncertainty
TL;DR: In this article, a solution is given to a programming problem under uncertainty when the distribution function of demand is discrete and the cost structure assumes a certain type, and the resulting objective function is convex, but not necessarily separable.
29
A Linear Programming Solution to Dynamic Leontief type Models
TL;DR: In this article, a general linear programming formulation of Leontief type relationships is presented, which is applicable to a wide variety of situations, such as industrial growth models, models of interregional dynamics, and estimates of structural changes in the economy.
References
Maximal Flow Through a Network
L. R. Ford,D. R. Fulkerson +1 more
TL;DR: In this paper, the problem of finding a maximal flow from one given city to another is formulated as follows: "Consider a rail network connecting two cities by way of a number of intermediate cities, where each link has a number assigned to it representing its capacity".
2.9K
Linear Programming under Uncertainty
TL;DR: 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.
1.6K