{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:57Z","timestamp":1760245077431,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1017954323460","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T14:36:44Z","timestamp":1041259004000},"page":"67-87","source":"Crossref","is-referenced-by-count":5,"title":["A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces"],"prefix":"10.1007","volume":"21","author":[{"given":"S.Y.","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"350880_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.5802\/aif.53","volume":"5","author":"G. Choquet","year":"1954","unstructured":"Choquet, G. (1954), Theory of capacities, Annales de l'Institut Fourier 5: 131-295.","journal-title":"Annales de l'Institut Fourier"},{"key":"350880_CR2","unstructured":"Fang, S.C., Lin, C.J. and Wu, S.Y. Relaxations of the cutting plane method for quadratic semiinfinite programming. (submitted)."},{"key":"350880_CR3","volume-title":"Linear Optimization and Extensions: Theory and Algorithms","author":"S.C. Fang","year":"1993","unstructured":"Fang, S.C. and Puthenpura, S.C. (1993), Linear Optimization and Extensions: Theory and Algorithms, Prentice Hall, Englewood Cliffs, New Jersey."},{"key":"350880_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/02331939408844009","volume":"31","author":"S.C. Fang","year":"1994","unstructured":"Fang, S.C., Lin, C.J. and Wu, S.Y. (1994), On solving convex quadratic semi-infinite programming problems, Optimization 31: 107-125.","journal-title":"Optimization"},{"key":"350880_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02546356","volume":"103","author":"B. Fugled","year":"1960","unstructured":"Fugled, B. (1960), On the theory of potentials in locally compact spaces. Acta Mathematica, 103: 139-215.","journal-title":"Acta Mathematica"},{"key":"350880_CR6","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/S1052623497315768","volume":"8","author":"O. Hernandez-Lerma","year":"1998","unstructured":"Hernandez-Lerma, O. and Lasserre, J.B. (1998), Approximation schemes for infinite linear programs, SIAM Journal on Optimization 8: 973-988.","journal-title":"SIAM Journal on Optimization"},{"key":"350880_CR7","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R. Hettich","year":"1993","unstructured":"Hettich, R. and Kortanek, K. (1993), Semi-infinite programming: theory, method and application, SIAM Review 35: 380-429.","journal-title":"SIAM Review"},{"key":"350880_CR8","volume-title":"Mathematical Methods and Theory in Games, Programming and Economics","author":"S. Karlin","year":"1959","unstructured":"Karlin, S. (1959), Mathematical Methods and Theory in Games, Programming and Economics, Pergamon, London."},{"key":"350880_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01586043","volume":"54","author":"H.C. Lai","year":"1992","unstructured":"Lai, H.C. and Wu, S.Y. (1992), Extremal points and optimal solutions for general capacity problems, Mathematical Programming, 54: 87-113.","journal-title":"Mathematical Programming"},{"key":"350880_CR10","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"Luenberger, D.G. (1984), Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts."},{"key":"350880_CR11","first-page":"45","volume":"30","author":"M. Ohtsuka","year":"1966","unstructured":"Ohtsuka, M. (1966), Generalized capacity and duality theorem in linear programming. Journal of Science, Hiroshima University Series A-I, 30: 45-56.","journal-title":"Journal of Science, Hiroshima University Series A-I"},{"key":"350880_CR12","first-page":"31","volume":"30","author":"M. Ohtsuka","year":"1966","unstructured":"Ohtsuka, M. (1966), A generalization of duality theorem in the theory of linear programming. Journal of Science, Hiroshima University Series A-I, 30: 31-39.","journal-title":"Journal of Science, Hiroshima University Series A-I"},{"key":"350880_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-1-4757-2868-2_7","volume-title":"Semi-Infinite Programming","author":"R. Reemtsen","year":"1998","unstructured":"Reemtsen, R. and G\u00f6rner, S. (1998), Numerical methods for semi-infinite programming: a survey. In: R. Reemtsen and J-J. Rueckmann (eds), Semi-Infinite Programming, Kluwer Academic Publishers, Boston, pp. 195-275."},{"key":"350880_CR14","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1080\/02331938808843393","volume":"19","author":"R. Tichatschke","year":"1988","unstructured":"Tichatschke, R. and Nebeling, V. (1988), A cutting plane algorithm for solving quadratic semi-infinite programs. Optimization, 19: 803-817.","journal-title":"Optimization"},{"key":"350880_CR15","unstructured":"Wu, S.Y. (1985), Linear programming in measure space. Ph.D. Dissertation, Cambridge University."},{"key":"350880_CR16","unstructured":"Wu, S.Y., (1985), The general capacity problem. In W. Oettli et al. (eds.), Methods of Operations Research, Oelgeschlager, Gunn and Hain."},{"key":"350880_CR17","first-page":"57","volume":"30","author":"M. Yamasaki","year":"1966","unstructured":"Yamasaki, M., (1966), On a capacity problem raised in connection with linear programming. Journal of Science, Hiroshima University Series A-I, 30: 57-73.","journal-title":"Journal of Science, Hiroshima University Series A-I"},{"key":"350880_CR18","first-page":"41","volume":"30","author":"M. Yosida","year":"1966","unstructured":"Yosida, M. (1966), Some examples related to duality theorem in linear programming. Journal of Science, Hiroshima University Series A-I, 30: 41-43.","journal-title":"Journal of Science, Hiroshima University Series A-I"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017954323460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1017954323460\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017954323460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:37:59Z","timestamp":1751366279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1017954323460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["350880"],"URL":"https:\/\/doi.org\/10.1023\/a:1017954323460","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}