✦ LIBER ✦

Partially-linear transportation problems

✍ Scribed by Chavdar Atanasov Dangalchev

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 471 KB
Volume: 91
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00367-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partially-linear transportation problems, obtained by means of absolute value functions

✍ Chavdar A. Dangalchev 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 763 KB

Nonlinear transportation problems may be successfully used to model problems in economics, due to the nonlinear relationship between quantities and the real cost for their transportation. In this paper we consider transportation problems with two-piece linear functions on arcs (which may be nonconve

A difficulty in linear programming for t

A difficulty in linear programming for transportation problems

✍ Marvin Luther; John E. Walsh 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## 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 fea

Solving generalized transportation probl

Solving generalized transportation problems via pure transportation problems

✍ Elsie Sterbin Gottlieb 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

A linear continuous transportation probl

A linear continuous transportation problem

✍ Enrique D Andjel; Tarcísio L Lopes; JoséMario Martinez 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Nonlinear one-parametric linear programm

Nonlinear one-parametric linear programming and t-norm transportation problems

✍ Axel Wüstefeld; Uwe Zimmermann 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

Previous methods for solving the nonlinear one-parametric linear programming problem min (c(r)'x IAx = b, x >/ 0) for f € b,PI were based on the simplex method using a considerably extended tableau. The proposed method avoids such an extension. A finite sequence of feasible bases (Bk I k = 1, 2, . .

Semi-infinite transportation problems

✍ Kenneth O Kortanek; Maretsugu Yamasaki 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 436 KB