An algorithm for nonlinear programs over Cartesian product sets
Published in Optimization • Jan 1, 1990
Authors:,
Torbjörn Larsson
Athanasios Migdalas
Abstract
We describe a solution procedure for nonseparable nonlinear programming problems over Cartesian product sets. Problems of this type frequently arise in transportation planning and in the analysis and design of computer communication networks. The basic algorithmic concept is to induce separability b...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!