The Dual Forest Iteration Method for The Stochastic Transportation Problem

Qi L (1984). The Dual Forest Iteration Method for The Stochastic Transportation Problem. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-84-059

[img]
Preview
Text
WP-84-059.pdf

Download (626kB) | Preview

Abstract

This paper presents a dual forest iteration algorithm for solving the stochastic transportation problem. The algorithm iterates from one dual forest to another with the values of the dual objective function strictly increasing in the nondegenerate case. It therefore converges in a finite number of steps. At each step it is necessary to solve at most two one-dimensional monotone equations. If the computation is interrupted before completion, a primal feasible solution, and upper and lower bounds to the optimal value of the objective function can be obtained. A numerical example is also presented.

Item Type: Monograph (IIASA Working Paper)
Research Programs: Adaption and Optimization (ADO)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:54
Last Modified: 31 Oct 2016 03:01
URI: http://pure.iiasa.ac.at/2459

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313