An explicit solution to the multi-level programming problem
暂无分享,去创建一个
[1] O. Mangasarian. Characterization of linear complementarity problems as linear programs , 1978 .
[2] James E. Falk,et al. A Strategic Weapons Exchange Allocation Model , 1977, Oper. Res..
[3] Giorgio Gallo,et al. Bilinear programming: An exact algorithm , 1977, Math. Program..
[4] W. Schmitendorf. Necessary conditions and sufficient conditions for static minmax problems , 1977 .
[5] Anthony V. Fiacco,et al. Sensitivity analysis for nonlinear programming using penalty methods , 1976, Math. Program..
[6] J. E. Falk,et al. Infinitely constrained optimization problems , 1976 .
[7] H. Konno. Applications of Bilinear Programming , 1975 .
[8] Anthony V. Fiacco,et al. Computational experience in sensitivity analysis for nonlinear programming , 1974, Math. Program..
[9] A. Cabot. Variations on a cutting plane method for solving concave minimization problems with linear constraints , 1974 .
[10] James E. Falk,et al. A linear max—min problem , 1973, Math. Program..
[11] Jerome Bracken,et al. Mathematical Programs with Optimization Problems in the Constraints , 1973, Oper. Res..
[12] Jerome Bracken,et al. Computer Program for Solving Mathematical Programs With Nonlinear Programs in the Constraints , 1972 .
[13] B. Eaves. The Linear Complementarity Problem , 1971 .
[14] Floyd J. Gould,et al. Stability in Nonlinear Programming , 1970, Oper. Res..
[15] J. E. Falk,et al. An Algorithm for Separable Nonconvex Programming Problems , 1969 .
[16] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[17] J. Bram. The Lagrange Multiplier Theorem for Max-Min with Several Constraints , 1966 .
[18] J. Danskin. The Theory of Max-Min, with Applications , 1966 .
[19] Morton D. Davis,et al. The kernel of a cooperative game , 1965 .
[20] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[21] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[22] A. W. Tucker,et al. Solving a Matrix Game by Linear Programming , 1960, IBM J. Res. Dev..
[23] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .
[24] Howard Raiffa,et al. Games And Decisions , 1958 .