Computing equilibria via nonconvex programming

DOI10.1002/NAV.3800270209MaRDI QIDQ3887267zbMATH OpenOpenAlexFDO

Authors Jonathan F. Bard, James E. Falk

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

branch and bound algorithmcomplementarity problemconvergenceeconomic examplesequilibria computationnetwork applications

Mathematics Subject Classification ID

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

Cited in

(1)

• An experimental investigation of enumerative methods for the linear complementarity problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887267)