𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A difficulty in linear programming for transportation problems

✍ Scribed by Marvin Luther; John E. Walsh

Publisher
John Wiley and Sons
Year
1959
Tongue
English
Weight
184 KB
Volume
6
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Linear programming has many worthwhile applications to transportation problems of a relatively uncomplicated nature. For inore complicated problems, however, a realistic linear‐programming formulation can require such an excessive number of variables that obtaining a solution is not feasible. This paper shows that an excessive number of variables is usually required when different types of items are to be transported subject to time restrictions and on carriers that can simultaneously handle several items.

πŸ“œ SIMILAR VOLUMES

Linear Programming in Some Ramsey Proble
Linear Programming in Some Ramsey Problems
✍ B.D. Mckay; S.P. Radziszowski πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 332 KB

We derive new upper bounds for the classical two-color Ramsey numbers \(R(4,5) \leqslant 27, R(5,5) \leqslant 52\), and \(R(4,6) \leqslant 43\); the previous best upper bounds known for these numbers were 28,53 , and 44 , respectively. The new bounds are obtained by solving large integer linear prog