Scarf’s generalization of linear complementarity problem revisited
DOI:
https://doi.org/10.2298/YJOR130203026NKeywords:
Scarf’s complementarity problem, Vertical linear complementarity problem, Cottle-Dantzig’s algorithm, Lemke’s algorithm, Neural network approachAbstract
In this paper, we revisit Scarf’s generalization of the linear complementarity problem, formulate this as a vertical linear complementarity problem and obtain some new results on this generalization. Also, a neural network model for solving Scarf’s generalized complementarity problems is proposed. Numerical simulation results show that the proposed model is feasible and efficient.References
Cottle, R. W., “Solution rays for a class of complementarity problems”, Mathematical Programming Study, 1 (1974) 59-74.
Cottle, R. W., and Dantzig, G. B., “A generalization of the linear complementarity problem”, Journal of Combinatorial Theory, 8 (1970) 79-90.
Cottle, R. W., Pang, J. S., and Stone, R. E., The Linear Complementarity Problem, Academic Press, New York, 1992.
Eaves, B. C., “The linear complementarity problem”, Management Science, 17 (1971) 612-634.
Ebiefung, A. A., and Kostreva, M. M., “The generalized Leontief input-output model and its application to the choice of new technology”, Annals of Operations Research, 44 (1993) 161-172.
Effati, S., and Jafarzadeh, M., “A new nonlinear neural network for solving a class of constrained parametric optimization problems”, Applied Mathematics and Computation, 186 (2007) 814–819.
Gowda, M. S., and Sznajder, R., “The generalized order linear complementarity problem”, SIAM Journal on Matrix Analysis and Applications, 15 (1994) 779-795.
Gowda, M. S., and Sznajder, R., “A generalization of the Nash equilibrium theorem on bimatrix games”, International Journal of Game Theory, 25 (1996) 1-12.
Gao, X., “Neural network for solving monotone linear complementary problems”, Communications in Nonlinear Science and Numerical Simulation, 4 (1999) 128–132.
Ghasabi-Oskoei, H., and Mahdavi-Amiri, N., “An efficient simplified neural network for solving linear and quadratic programming problems”, Applied Mathematics and Computation, 175 (2006) 452–464.
Kennedy, M. P., and Chua, L. O., “Neural networks for non-linear programming”, IEEE Transactions on Circuits System, 35 (1988) 554–562.
Habetler, G. J., and Haddad, C. A., “Global stability of a two-species piecewise linear Volterra ecosystem”, Applied Mathematics Letters, 5 (6) (1992) 25-28.
Lemke, C. E., “Recent results on complementarity problems”, in: J. B. Rosen, O. L. Mangasarian, and K. Ritter (eds.), Nonlinear Programming, Academic Press, New York, (1970) 349-384.
Lemke, C. E., “Bimatrix equilibrium points and mathematical programming”, Management Science, 11 (1965) 681-689.
Mohan, S. R., and Neogy, S. K., “Generalized linear complementarity in a problem of n person games”, Technical Report # 9404, Indian Statistical Institute, Delhi Centre, India, 1994.
Mohan, S. R., Neogy, S. K., and Sridhar, R., “The generalized linear complementarity problem revisited”, Mathematical Programming, 74 (1996) 197–218.
Murty, K. G., Linear Complementarity, Linear and Nonlinear Programming, Heldermann Verlag, West Berlin, 1988.
Neogy, S. K., Das, A. K., and Das, P., “Complementarity problem involving a Vertical Block Matrix and its Solution using Neural Network Model”, in: S. K. Neogy, R. B. Bapat, A. K. Das, and T. Parthasarathy (eds.), Mathematical Programming and Game Theory for Decision Making, ISI Platinum Jubilee Series on Statistical Science and Interdisciplinary Research, 1 (2008) 113–130.
Wu, X., Xia, Y., Li, J., and Chen, W., “A high performance neural network for solving linear and quadratic programming problems”, IEEE Transactions on Neural Networks, 7 (1996) 643-651.
Downloads
Published
Issue
Section
License
Copyright (c) 2013 YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
