journal article
LitStream Collection
Home
doi: 10.1002/nav.3800010107pmid: N/A
Many problems in logistics are capable of being formulated as linear programming problems. For example, one such problem is the so‐called transportation problem, which is concerned with obtaining the best way (in the sense of least time, or of least expense, etc.) of shipping stipulated quantities of materials from m origins to n destinations. This paper develops a new computational method of solving general linear programming problems.
Stanley, E. D.; Honig, D. P.; Gainen, Leon
doi: 10.1002/nav.3800010108pmid: N/A
This paper presents the difficulties which arise in a particular Government procurement agency in an attempt to determine the allocation of contracts which would result in the lowest over‐all cost to the Government. It is shown how the recently developed mathematical discipline of linear programming can be applied to such problems.
doi: 10.1002/nav.3800010109pmid: N/A
In many military “games” each “player” must allocate his forces to different “battlefields,” “fronts.” or “operations areas” before he has a clear picture of the deployment of the enemy. The following paper illustrates how each player should distribute his forces in certain interdiction games.
doi: 10.1002/nav.3800010110pmid: N/A
Each of a collection of items are to be produced on two machines (or stages). Each machine can handle only one item at a time and each item must be processed through machine one and then through machine two. The setup time plus work time for each item for each machine is known. A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum. A three‐machine problem is also discussed and solved for a restricted case.
Showing 1 to 10 of 12 Articles