Computing equilibria via nonconvex programming

DOI10.1002/nav.3800270209zbMath0443.90105OpenAlexW2117214032MaRDI QIDQ3887267

James E. Falk, Jonathan F. Bard

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270209

zbMATH Keywords

convergencebranch and bound algorithmcomplementarity problemnetwork applicationseconomic examplesequilibria computation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Deterministic network models in operations research (90B10) General equilibrium theory (91B50)

Related Items (1)

An experimental investigation of enumerative methods for the linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Computing equilibria via nonconvex programming