Using Objective Values to Start Multiple Objective Linear Programming Algorithms

5584 14 4482 2 10066 document 4482 IR-98-066.pdf application/pdf b5bdfb0388a2289c3ff22ca36d4d0210 MD5 170372 2016-01-15 02:10:15 https://pure.iiasa.ac.at/id/eprint/5584/1/IR-98-066.pdf 5584 1 1 text en public

IR-98-066.pdf

15 8133 1 16134 document 8133 indexcodes.txt text/x-c++ bdeb3c230c126522588b51cb36ffe97e MD5 6790 2016-01-15 04:45:06 https://pure.iiasa.ac.at/id/eprint/5584/2/indexcodes.txt 5584 2 2 text/x-c++ 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/4482 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/isIndexCodesVersionOf https://pure.iiasa.ac.at/id/document/4482 8134 2 16135 document 8134 lightbox.jpg image/png 12c68dbd7157693d3856116486e588bb MD5 19832 2016-01-15 04:45:08 https://pure.iiasa.ac.at/id/eprint/5584/3/lightbox.jpg 5584 3 3 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/4482 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/islightboxThumbnailVersionOf https://pure.iiasa.ac.at/id/document/4482 8135 2 16136 document 8135 preview.jpg image/png a4c9161163dd7a614db41af12cd96a16 MD5 8081 2016-01-15 04:45:09 https://pure.iiasa.ac.at/id/eprint/5584/4/preview.jpg 5584 4 4 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/4482 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/ispreviewThumbnailVersionOf https://pure.iiasa.ac.at/id/document/4482 8136 2 16137 document 8136 medium.jpg image/png c8662fb77b7696cee4d968ac67b9c76d MD5 3061 2016-01-15 04:45:09 https://pure.iiasa.ac.at/id/eprint/5584/5/medium.jpg 5584 5 5 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/4482 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/ismediumThumbnailVersionOf https://pure.iiasa.ac.at/id/document/4482 8137 2 16138 document 8137 small.jpg image/png 80ae7b6d0468c30089ad6d1dedfc1206 MD5 1042 2016-01-15 04:45:10 https://pure.iiasa.ac.at/id/eprint/5584/6/small.jpg 5584 6 6 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/4482 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/issmallThumbnailVersionOf https://pure.iiasa.ac.at/id/document/4482 74132 2 204053 document 74132 IR-98-066.pdf application/pdf 958c8437f0db8242273864b46e2b5be5 MD5 181958 2016-11-18 17:03:26 https://pure.iiasa.ac.at/id/eprint/5584/7/IR-98-066.pdf 5584 7 7 application/pdf other Coversheet Pages conversion from text to application/pdf en public

IR-98-066.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/4482 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/4482 archive 351 disk0/00/00/55/84 2016-01-15 02:10:15 2021-08-27 17:16:25 2016-01-15 02:10:15 monograph show 2 Arbel A. Korhonen P. 7606 Using Objective Values to Start Multiple Objective Linear Programming Algorithms pub iis_met iis_sys prog_das We introduce in this paper a new starting mechanism for multi-objective linear programming (MOLP) algorithms. This makes it possible to start an algorithm from any solution in objective space. The original problem is first augmented in such a way that a given starting point is feasible. The augmentation is explicitly or implicitly controlled by one parameter during the search process, which verifies the feasibility (efficiency) of the final solution. This starting mechanism can be applied either to traditional algorithms, which search the exterior of the constraint polytope, or to the algorithms moving through the 2interior of the constraints. We provide recommendations on the suitability of an algorithm for the various locations of a starting point in objective space. Numerical considerations illustrate these ideas. 1998-08 published IR-98-066 IR-98-066 2062 public interim_report IIASA, Laxenburg, Austria 21 FALSE info:eu-repo/semantics/book