«СИММЕТРИЧНАЯ ДВОЙСТВЕННОСТЬ В ВЫПУКЛОЙ ОПТИМИЗАЦИИ И МОДЕЛИ ПОТОКОРАСПРЕДЕЛЕНИЯ ...»

147. Broyden C.G. On theorems of the alternative // Optimization methods and software. – 2001. – Vol. 16. – P. 101-111.

148. Cross H., Analysis of flow in networks of conduits or conductors // Urbana Illinois: Eng. Exp. Station of Univ. of Illinois. – 1936. – November. – Bull. N 286. – 29 p.

149. Dafermos S. Traffic Equilibrium and Variational Inequalities // «Transportation Science». – 1980. – V.14. – P.42–54.

150. Dantzig G. B., Eisenberg E., and Cottle R.W., “Symmetric dual nonlinear programs,” Pacific Journal of Mathematics, vol. 15, pp. 809–812, 1965.

151. Devi G., Symmetric duality for nonlinear programming problem involving -bonvex functions, European J. Oper. Res. 104 (1998) 615–621.

152. Dorn W.S., A symmetric dual theorem for quadratic programming, Journal of the Operations Research Society of Japan 2 (1960) 93–97.

153. Fenchel W. Convex Cones, Sets and Functions. – Princeton University Press, Princeton, New Jersey. – 1951.

154. Fletcher R. Practical methods of optimization. 2nd ed. WileyInterscience, New York, 2000. – 450 p.

155. Ford L.R., Fulkerson D.R., Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.

156. George, A., Liu, J. W. H. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1-19, 1989.

157. Gill, P. E., Murray W., and Wright M. H.: Practical Optimization, Academic Press, London, 1981.

158. Goh C.-J.,Yang X.Q. Duality in optimization and Variational inequalities. – Taylor & Francis, 2002.–313 p.–(Optimization theory and applications, vol. 2) 159. Guye O. M., Dussault J.-P., Mahey P. Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming // Journal of optimization theory and applications. – Springer Science, 2005, Vol.

127, No. 2. – pp. 329–345.

160. Harris T.E., Ross F.S., Fundamentals of a Method for Evaluating Rail Net Capacities, Research Memorandum RM-1573, The RAND Corporation, Santa Monica, California, 1955.

161. Haurie A., Marcotte P. On the relationship between Nash-Cournot and Wardrop equilibria // Networks 15. – 1985. – P.295–308.

162. Hitchcock F.L., The distribution of a product from several sources to numerous localities // J. of Mathematics and Physics, vol. 20, 1941. – pp. 224-230.

163. Ibaraki S., Fukushima M., Ibaraki T. Primal-Dual Proximal Point Algorithm for Linearly Constrained Convex Programming Problems // Computational Optimization and Applications. – Kluwer Academic Publishers, 1992, №1. – pp. 207–226.

164. Karmarkar N. A new polynomial-time algorithm for linear programming // Combinatorica, 1984, №4, pp.373-395.

165. Koopmans Tj.C., Optimum utilization of the transportation system, in:

The Econometric Society Meeting (Washington, D.C., 1947; D.H. Leavens, ed.) [Proc. of the International Statistical Conf. – Volume V], 1948, pp. 136–146.

166. Koopmans Tj.C., Reiter S., A model of transportation, in: Activity Analysis of Production and Allocation – Proceedings of a Conference (Tj.C.

Koopmans, ed.), Wiley, New York, 1951, pp. 222–259.

167. Kuhn Н. W. and Tucker A. W. “Nonlinear Programming”, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (J. Neyman, ed.), Berkeley, University of California Press, 1951, pp. 481-492.

168. Mays L. W., Water distribution systems handbook. – McGraw-Hill, 2000. 912 p.

169. Mond B., “A symmetric dual theorem for non-linear prоgrams”, Quarterly ofApplied Mathematics, vol. 23, pp. 265–269, 1965.

170. Mond B., Weir T., Generalized concavity and duality, in: S. Schaible, W.T. Ziemba (Eds.), Generalized Concavity in Optimization and Economics, Academic Press, New York, 1981.

171. Nagurney A., Siokos S., Financial Networks: statics and dynamics, Springer-Verlag, 1997.

172. Nagurney A. Network Economics: a Variational Inequality Approach. – Dordrecht: «Kluwer Academic Publishers». – 1999.

173. Nagurney A. (Ed.), “Innovations in Financial and Economic Networks”, New Dimensions in Networks, 2003. – 352 p.

174. Nesterov, Y., and A. Nemirovskii: Interior-Point Polynomial Algorithms in Convex Programming // Studies in Applied Mathematics, Vol. 13. – Society for Industrial and Applied Mathematics, 1994.

175. Ouorou A. A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization// Computational Optimization and Applications. – Kluwer Academic Publishers, 2000, №15. – pp. 125–143.

176. Rockarellar R.T. Conjugate Duality and Optimization. – SIAM, Philadelphia, 1974. – 80 p.

177. Rockafellar R. Tyrrell: Network flows and monotropic optimization. – Pure and Applied Mathematics. – New York: Wiley-Interscience, 1984. – 616 p.

178. Rockafellar R.T., Wets R. J.-B. Variational analysis. – Springer-Verlag, Berlin, Heidelberg, 1998. – 733 p.

179. Singer I. Duality for nonconvex approximation and optimization. – Springer, 2006. – 375 p.

180. Sinha S.M. Mathematical programming. – Elsevier, 2006. – 570 p.

181. Smith M. The existence, uniqueness, and stability of traffic equilibria // «Transport. Research». – 1979 – P.259–304.

182. Vanderbei R., Meketon M., Freedman B. A modification of Karmarkar’s linear programming algorithm // Algorithmica, 1986, №1, pp. 395-407.

183. Ventura J. A. Computational development of a lagrangian dual approach for quadratic networks // Networks. – Wiley Periodicals, 2006, Volume 21, Issue 4, Pages 469 – 485.

184. Walk M. Theory of Duality in Mathematical Programming. – SpringerVerlag, 1989. – 178 p.

185. Walski T. M., Haestad Methods, Inc.: Advanced Water Distribution Modeling and Management. – Haestead Press, 186. Wardrop J. Some theoretical aspects of road traffic research // Proc. Inst.

Civil Engineers II. – 1952. – P.325–378.

187. Zenios S.A., Mulvey J.M. Relaxation techniques for strictly convex network problems // Annals of Operations Research. – Scientific Publishing Company, 1985, №5. – pp. 517–538.

188. Wolfe, P., A Duality Theorem for Nonlinear Programming, Quarterly of Applied Mathematics, Vol. 19, pp. 239–244, 1961.

Приложение