Variational inequalities and discrete and continuum models of network equilibrium problems
From MaRDI portal
Publication:1609502
DOI10.1016/S0895-7177(02)80030-9zbMath0994.90033OpenAlexW1973146216MaRDI QIDQ1609502
Patrizia Daniele, Antonino Maugeri
Publication date: 15 August 2002
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(02)80030-9
Related Items
Infinite time-dependent network equilibria with a multivalued cost function, Vector equilibrium problems with elastic demands and capacity constraints, Vector network equilibrium problems with capacity constraints of arcs and nonlinear scalarization methods, An equilibrium model for urban transit assignment based on game theory, Variational methods for equilibrium problems involving quasi-concave utility functions, Duality theory and applications to unilateral problems, Quasivariational inequalities for a dynamic competitive economic equilibrium problem, Remarks on infinite dimensional duality, Equilibria trajectories as stationary solutions of infinite-dimensional projected dynamical sys\-tems., Existence and regularity of solutions to nonlinear degenerate evolutionary variational inequalities with applications to dynamic network equilibrium problems, A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule, Variational inequalities and discrete and continuum models of network equilibrium problems
Cites Work
- Exchange price equilibria and variational inequalities
- Convex programming, variational inequalities, and applications to the traffic equilibrium problem
- Variational inequalities and discrete and continuum models of network equilibrium problems
- Network economics: a variational inequality approach
- Time-dependent traffic equilibria
- Disequilibrium and variational inequalities
- Variational inequalities and time-dependent traffic equilibria
- Variational inequalities
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item