๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Auxiliary procedures for solving long transportation problems

โœ Scribed by J. Intrator; M. Berrebi

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
243 KB
Volume
27
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented.

๐Ÿ“œ SIMILAR VOLUMES

On three basic methods for solving bottl
On three basic methods for solving bottleneck transportation problems
โœ Ulrich Derigs ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 499 KB

For solving transportation problems essentially three types of methods are known: primal methods, the Hungarian method and the shortest augmenting path method. In this paper we present the specialization of these approaches to the bottleneck transportation problem and report some computational exper

A fuzzy goal programming procedure for s
A fuzzy goal programming procedure for solving quadratic bilevel programming problems
โœ Bijay Baran Pal; Bhola Nath Moitra ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB

This article presents a fuzzy goal programming (FGP) procedure for solving quadratic bilevel programming problems (QBLPP). In the proposed approach, the membership functions for the defined fuzzy objective goals of the decision makers (DM) at both the levels are developed first. Then, a quadratic pr

An iterative procedure for solving a Cau
An iterative procedure for solving a Cauchy problem for second order elliptic equations
โœ Tomas Johansson ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB

## Abstract An iterative method for reconstruction of solutions to second order elliptic equations by Cauchy data given on a part of the boundary, is presented. At each iteration step, a series of mixed wellโ€posed boundary value problems are solved for the elliptic operator and its adjoint. The con