95 21 69 3 163 document 69 WP-74-076.pdf application/pdf cacb9bb4602ce178fd17b5a59f77615e MD5 371824 2016-01-15 01:40:44 https://pure.iiasa.ac.at/id/eprint/95/1/WP-74-076.pdf 95 1 1 text en public
WP-74-076.pdf
22 ec2b6cceaa5685d8c17f5f610748c172148d617d 31386 2 43118 document 31386 lightbox.jpg image/png ee994445aaada3fe36c653ab9e9d199b MD5 10477 2016-01-16 00:02:30 https://pure.iiasa.ac.at/id/eprint/95/2/lightbox.jpg 95 2 2 image/png other Thumbnails conversion from text to thumbnail_lightbox en public
lightbox.jpg
http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/islightboxThumbnailVersionOf https://pure.iiasa.ac.at/id/document/69 31387 2 43119 document 31387 preview.jpg image/png e0228995bfb57207ecf380aca22e32ca MD5 4617 2016-01-16 00:02:30 https://pure.iiasa.ac.at/id/eprint/95/3/preview.jpg 95 3 3 image/png other Thumbnails conversion from text to thumbnail_preview en public
preview.jpg
http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/ispreviewThumbnailVersionOf https://pure.iiasa.ac.at/id/document/69 31388 2 43120 document 31388 medium.jpg image/png 1fda656055470d78f1115b2abb6ddf7a MD5 1537 2016-01-16 00:02:31 https://pure.iiasa.ac.at/id/eprint/95/4/medium.jpg 95 4 4 image/png other Thumbnails conversion from text to thumbnail_medium en public
medium.jpg
http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/ismediumThumbnailVersionOf https://pure.iiasa.ac.at/id/document/69 31389 2 43121 document 31389 small.jpg image/png 0379eaf7c3844ebb1ceae67c8db1ac2a MD5 907 2016-01-16 00:02:32 https://pure.iiasa.ac.at/id/eprint/95/5/small.jpg 95 5 5 image/png other Thumbnails conversion from text to thumbnail_small en public
small.jpg
http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/issmallThumbnailVersionOf https://pure.iiasa.ac.at/id/document/69 31399 1 43131 document 31399 indexcodes.txt text/x-pascal f1c63f499c89413eb7d459d6427a0a35 MD5 4291 2016-01-16 00:02:44 https://pure.iiasa.ac.at/id/eprint/95/6/indexcodes.txt 95 6 6 text/x-pascal other Generate index codes conversion from text to indexcodes en public
indexcodes.txt
http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isIndexCodesVersionOf https://pure.iiasa.ac.at/id/document/69 83514 2 234630 document 83514 WP-74-076.pdf application/pdf 7918ecadc9fcbdc8f61cd4ca8d302e95 MD5 1064014 2018-03-14 15:17:12 https://pure.iiasa.ac.at/id/eprint/95/7/WP-74-076.pdf 95 7 7 application/pdf other Coversheet version en public
WP-74-076.pdf
http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/69 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/69 archive 351 disk0/00/00/00/95 2016-01-15 01:40:44 2021-08-27 17:07:24 2016-01-15 01:40:44 monograph show 4 Konno H. AL0204 Maximization of a Convex Quadratic Function Under Linear Constraints pub iis_das prog_sds Since the appearance of a paper by H. Tui, maximization of convex function over a polytope has attracted much attention. In his paper, two algorithms were proposed: one cutting plane and the other enumerative. However, the numerical experiments reported on the naive cutting plane approach were discouraging enough to shift the researchers more to the direction of enumerative approaches. In this paper, we will develop a cutting plane algorithm for maximizing a convex quadratic function subject to linear constraints. The basic idea is much the same as Tui's method. It also parallels some of the recent results by E. Balas and C-A. Burdet. We will, however, use standard tools which are easier to understand and will fully exploit the special structure of the problem. The main purpose of the paper is to demonstrate that the full exploitation of special structure will enable us to generate a cut which is much deeper than Tui's cut and that the cutting plane algorithm can be used to solve a rather big problem efficiently. 1974 published WP-74-076 WP-74-076 10 2058 public working_paper IIASA, Laxenburg, Austria 18 FALSE FALSE info:eu-repo/semantics/book