Premium
GENERALIZED NETWORK SPATIAL EQUILIBRIUM: THE DETERMINISTIC AND THE CHANCE‐CONSTRAINED CASE
Author(s) -
Thore Sten
Publication year - 1986
Publication title -
papers in regional science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.937
H-Index - 64
eISSN - 1435-5957
pISSN - 1056-8190
DOI - 10.1111/j.1435-5597.1986.tb00984.x
Subject(s) - constraint (computer aided design) , mathematics , nonlinear system , link (geometry) , node (physics) , mathematical optimization , constant (computer programming) , mathematical economics , computer science , physics , combinatorics , geometry , quantum mechanics , programming language
ABSTRACT The flow along each link in a generalized network is amplified or attenuated by some constant factor during the course of its traversal of the link. It is shown that the equilibrium solution can be found by employing a well‐known extremal principle, originally due to P. A. Samuelson. When the attenuation factor along each link is random, the Kirchhoff node conditions can no longer be satisfied with certainty, but may be replaced by a chance constraint. The extremal principle can be employed again, and this time lakes the form of a chance‐constrained nonlinear program. The solution involves the existence of an optimal buffer stock at each node.