×

A remark on a standard and linear vector network equilibrium problem with capacity constraints. (English) Zbl 1175.90068

Summary: (Weak) vector equilibrium principle with capacity constraints is introduced. A necessary condition that a vector minimum cost flow is a vector equilibrium flow with capacity constraints is obtained. When the number of paths connecting with each pair of source and sink is less than or equal to 2, a sufficient condition for a vector minimum cost flow to be a vector equilibrium flow is also obtained. A generalized (weak) vector equilibrium principle is also introduced. Without any additional assumption, a necessary and sufficient condition for a (weak) vector minimum cost flow to be a generalized (weak) vector equilibrium flow is obtained.

MSC:

90B10 Deterministic network models in operations research
90B20 Traffic problems in operations research
PDF BibTeX XML Cite
Full Text: DOI Link

References:

[1] Ahuja, R.K.; Magnanti, T.L.; Orlin, J.B., Network flows: theory, algorithms and applications, (1993), Prentice-Hall Englewood Cliffs, NJ · Zbl 1201.90001
[2] Assad, A.A., Multicommodity network flows: A survey, Networks, 8, 37-91, (1978) · Zbl 0381.90040
[3] G.Y. Chen, N.D. Yen, On the variational inequality model for network equilibrium, Internal Report 3.196 (724), Department of Mathematics, University of Pisa, 1993.
[4] Chen, G.Y.; Goh, C.J.; Yang, X.Q., Vector network equilibrium problems and nonlinear scalarization methods, Mathematical methods of operations research, 49, 239-253, (1999) · Zbl 0939.90014
[5] Current, J.; Marsh, M., Multiobjective transportation network design and routing problems: taxonomy and annotation, European journal of operations research, 65, 4-19, (1993) · Zbl 0775.90150
[6] Daniele, P.; Maugeri, A.; Oettli, W., Time-dependent traffic equilibria, Journal of optimization theory and applications, 103, 543-555, (1999) · Zbl 0937.90005
[7] Daniele, P.; Franco, Giannessi; Antonino, Maugeri, Equilibrium problems and variational models. including papers from the meeting held in Erice, June 23-july 2, 2000, Nonconvex optimization and its applications, vol. 68, (2003), Kluwer Academic Publishers Norwell, MA · Zbl 1030.00031
[8] Daniele, P.; Maugeri, A., Variational inequalities and discrete and continuum models of network equilibrium problems, Mathematical and computer modeling, 35, 393-411, (2000)
[9] Friesz, T.L.; Anandalingam, G.; Mehta, N.J.; Nam, K.; Shah, S.J.; Tobin, R.L., The multiobjective equilibrium network design problem revisited: A simulated annealing approach, European journal of operations research, 65, 44-57, (1993) · Zbl 0772.90043
[10] Giannessi, F.; Maugeri, A., Variational inequalities and network equilibrium problems, () · Zbl 0834.00044
[11] Giannessi, F., Vector variational inequalities and vector equilibria, (2000), Kluwer Academic Publisher · Zbl 0952.00009
[12] Goh, C.J.; Yang, X.Q., Theory and methodology of vector equilibrium problem and vector optimization, European journal of operational research, 116, 615-628, (1999) · Zbl 1009.90093
[13] Maurras, J.F.; Vaxes, Y., Multicommodity network flow with jump constraints, Discrete mathematics, 165/166, 481-486, (1997) · Zbl 0872.90038
[14] Nagurney, A., Network economics, A variational inequality approach, (1999), Kluwer Academic Publishers Dordrecht
[15] A. Nagurney, J. Dong, Supernetworks decision-making for the information age, Edward Elgar, Cheltenham, UK, Northampton, MA, USA, 2002.
[16] Tzeng, G.H.; Chen, C.H., Multiobjective decision making for traffic assignment, IEEE transactions of engineering management, 40, 180-187, (1993)
[17] Yang, X.Q.; Goh, C.J., On vector variational inequalities: application to vector equilibria, Journal of optimization theory and applications, 95, 431-443, (1997) · Zbl 0892.90158
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.