A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron. (English) Zbl 0362.90108
References:
| [1] | S.G. Bali, ”Minimization of a concave function on a bounded convex polyhedron”, Dissertation, Engineering Systems Department, University of California, Los Angeles (1973). |
| [2] | M.L. Balinski, ”An algorithm for finding all vertices of convex polyhedral sets”,SIAM Journal 9 (1961) 72–89. · Zbl 0108.33203 |
| [3] | C.A. Burdet, ”Generating all the faces of a polyhedron”,SIAM Journal of Applied Mathematics 26 (1974) 479–489. · doi:10.1137/0126045 |
| [4] | A.V. Cabot, ”Variations on a cutting plane method for solving concave minimization problems with linear constraints”,Naval Logistics Research Quarterly 21 (1974) 265–274. · Zbl 0348.90131 · doi:10.1002/nav.3800210206 |
| [5] | A.V. Cabot and R.L. Francis, ”Solving certain nonconvex quadratic minimization problems by ranking the extreme points”,Operations Research 18 (1970) 82–86. · Zbl 0186.24201 · doi:10.1287/opre.18.1.82 |
| [6] | R. Carvajal-Moreno, ”Minimization of concave functions subject to linear constraints”, Report ORC 72-3, Operations Research Center, University of California, Berkeley (1972). |
| [7] | N.V. Chernikova, ”Algorithm for finding general formula for the nonnegative solutions of a system of linear inequalities”,U.S.S.R. Computational Mathematics and Mathematical Physics 5 (1965) 228–233. · Zbl 0171.35701 · doi:10.1016/0041-5553(65)90045-5 |
| [8] | R.W. Cottle and W.C. Mylander, ”Ritter’s cutting plane method for nonconvex quadratic programming”, in: J. Abadie, ed.,Integer and nonlinear programming (North Holland, Amsterdam, 1970) pp. 257–283. · Zbl 0332.90033 |
| [9] | G.B. Dantzig and P. Wolfe, ”The decomposition algorithm for linear programming”,Operations Research 8 (1960) 101–111. · Zbl 0093.32806 · doi:10.1287/opre.8.1.101 |
| [10] | J.E. Falk and K.R. Hoffman, ”A successive underestimation method for concave minimization problems”,Mathematics of Operations Research 1 (1976) 251–259. · Zbl 0362.90082 · doi:10.1287/moor.1.3.251 |
| [11] | J.E. Falk and R.M. Soland, ”An algorithm for separable nonconvex programming problems”,Management Science 15 (1969) 550–569. · Zbl 0172.43802 · doi:10.1287/mnsc.15.9.550 |
| [12] | F. Glover, ”Convexity cuts and cut search”,Operations Research 21 (1973) 123–134. · Zbl 0263.90020 · doi:10.1287/opre.21.1.123 |
| [13] | Donald E. Knuth,The art of computer programming (Addison-Wesley, Reading, MA, 1968). · Zbl 0191.17903 |
| [14] | L.S. Lasdon,Optimization theory of large systems(Macmillan, New York, 1970). · Zbl 0224.90038 |
| [15] | A. Majthay and A. Whinston, ”Quasiconcave minimization subject to linear constraints”,Discrete Mathematics 9 (1974) 35–59. · Zbl 0301.90037 · doi:10.1016/0012-365X(74)90070-3 |
| [16] | T.H. Mattheiss, ”An algorithm for the determination of irrelevant constraints and all vertices in a system of linear inequalities”,Operations Research 21 (1973) 247–260. · Zbl 0265.90024 · doi:10.1287/opre.21.1.247 |
| [17] | M. Manas and J. Nedoma, ”Finding all vertices of a convex polyhedron”,Numerische Mathematik 12 (1968) 226–229. · Zbl 0165.51801 · doi:10.1007/BF02162916 |
| [18] | B. Martos, ”The direct power of adjacent vertex programming methods”,Management Science 12 (1965) 241–252. · Zbl 0142.17002 · doi:10.1287/mnsc.12.3.241 |
| [19] | R. Meyer, ”The validity of a family of optimization methods”,SIAM Journal on Control 8 (1970) 41–54. · Zbl 0194.20501 · doi:10.1137/0308003 |
| [20] | T.S. Motzkin, G.L. Thompson and R.M. Thrall, ”The double description method”, in: H.W. Kuhn and A.W. Tucker, eds.,Contribution to the theory of games Vol. 2 (Princeton University Press, Princeton, NJ, 1953) pp. 51–73. · Zbl 0050.14201 |
| [21] | K.G. Murty, ”Solving the fixed charge problem by ranking the extreme points”,Operations Research 16 (1968) 268–279. · Zbl 0249.90041 · doi:10.1287/opre.16.2.268 |
| [22] | M. Raghavachari, ”On connections between zero–one integer programming and concave programming under linear constraints”,Operations Research 17 (1969) 680–684. · Zbl 0176.49805 · doi:10.1287/opre.17.4.680 |
| [23] | K. Ritter, ”A method for solving maximum problems with a nonconcave quadratic objective function”,Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 4 (1966) 340–351. · Zbl 0139.13105 · doi:10.1007/BF00539118 |
| [24] | J.B. Rosen, ”Iterative solution of nonlinear optimal control problems”,SIAM Journal on Control 4 (1966) 223–244. · Zbl 0229.49025 · doi:10.1137/0304021 |
| [25] | M. Rössler, ”Eine methode zur berechnung des optimalen produktionsprogramms bei konkaver zielfunktion (translated as: ”A method to calculate an optimal production plan for a concave objective function”),Unternehmensforschung 15 (1971) 103–111. · Zbl 0213.45703 · doi:10.1007/BF01939818 |
| [26] | G.J. Silverman, ”Computational Consideration in extreme point enumeration”, ORSA 41st National Meeting, New Orleans, Louisiana, April 1972. |
| [27] | H.A. Taha, ”Concave minimization over a convex polyhedron”,Naval Research Logistics Quarterly 20 (1973) 533–548. · Zbl 0286.90052 · doi:10.1002/nav.3800200313 |
| [28] | H. Tui, ”Concave programming under linear constraints”,Soviet Mathematics 5 (1964), 1437–1440. · Zbl 0132.40103 |
| [29] | P.B. Zwart, ”Global maximization of a convex function with linear inequality constraints”,Operations Research 22 (1974) 602–609. · Zbl 0322.90049 · doi:10.1287/opre.22.3.602 |
| [30] | P.B. Zwart, ”Nonlinear programming: counterexamples to global optimization algorithms by Ritter and Tui”,Operations Research 21 (1973) 1260–1266. · Zbl 0274.90049 · doi:10.1287/opre.21.6.1260 |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
