Telecommunicatie en Informatieverwerking UNIVERSITEIT GENT Didactisch materiaal bij de cursus Academiejaar Tel: 09/ Fax: 09/ Prof. dr. ir. W. Philips Optimalisatietechnieken

© W. Philips, Universiteit Gent, versie: 28/2/ a. 2 Copyright notice This powerpoint presentation was developed as an educational aid to the renewed course “Optimisation Techniques” (Optimalisatietechnieken), taught at the University of Gent, Belgium as of This presentation may be used, modified and copied free of charge for non-commercial purposes by individuals and non-for-profit organisations and distributed free of charge by individuals and non-for-profit organisations to individuals and non-for-profit organisations, either in electronic form on a physical storage medium such as a CD-rom, provided that the following conditions are observed: 1.If you use this presentation as a whole or in part either in original or modified form, you should include the copyright notice “© W. Philips, Universiteit Gent, 1998” in a font size of at least 10 point on each slide; 2.You should include this slide (with the copyright conditions) once in each document (by which is meant either a computer file or a reproduction derived from such a file); 3. If you modify the presentation, you should clearly state so in the presentation; 4.You may not charge a fee for presenting or distributing the presentation, except to cover your costs pertaining to distribution. In other words, you or your organisation should not intend to make or make a profit from the activity for which you use or distribute the presentation; 5. You may not distribute the presentations electronically through a network (e.g., an HTTP or FTP server) without express permission by the author. In case the presentation is modified these requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the presentation, and can be reasonably considered independent and separate works in themselves, then these requirements do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the presentation, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. In particular note that condition 4 also applies to the modified work (i.e., you may not charge for it). “Using and distributing the presentation” means using it for any purpose, including but not limited to viewing it, presenting it to an audience in a lecture, distributing it to students or employees for self-teaching purposes,... Use, modification, copying and distribution for commercial purposes or by commercial organisations is not covered by this licence and is not permitted without the author’s consent. A fee may be charged for such use. Disclaimer: Note that no warrantee is offered, neither for the correctness of the contents of this presentation, nor to the safety of its use. Electronic documents such as this one are inherently unsafe because they may become infected by macro viruses. The programs used to view and modify this software are also inherently unsafe and may contain bugs that might corrupt the data or the operating system on your computer. If you use this presentation, I would appreciate being notified of this by . I would also like to be informed of any errors or omissions that you discover. Finally, if you have developed similar presentations I would be grateful if you allow me to use these in my course lectures. Prof. dr. ir. W. Philips Department of Telecommunications and Information ProcessingFax: University of GentTel: St.-Pietersnieuwstraat 41, B9000 Gent, Belgium

Lineair programmeren Herhaling

© W. Philips, Universiteit Gent, versie: 28/2/ a. 4...Definities: extreme punten Als het optimum uniek is dan is het een extreem punt; zoniet is er minstens één optimum dat een extreem punt is A B C D E F intern punt niet-extreem randpunt extreem randpunt optimum Extreem punt van een convex gebied  : punt van  dat niet op een lijnstuk tussen twee andere punten van  ligt mogelijke oplossingen: extreem en optimaal x1x1 x2x2

© W. Philips, Universiteit Gent, versie: 28/2/ a. 5 Simplexmethode: Voorbeeld... x 1 = 0, x 2 = 0 zijn geldige NB-variabelen (op zicht!) De corresponderende oplossing x=(0, 0, 1000, 1500, 1750, 4800) is niet- negatief  x is een extreem punt  kies x (0) = x x 1 +x 3 = 1000 x 2 +x 4 = 1500 x 1 +x 2 +x 5 = x x 2 +x 6 = 4800 x 1, x 2, x 3, x 4, x 5, x 6  0 Trofeeprobleem: Maximaliseer 12 x 1 +9 x 2 waarbij Stap 1: bepaal de simplex-richtingen: bereken de B-variabelen x b = ( x 3, x 4, x 5, x 6 ) in functie van de NB-variabelen x nb = ( x 1, x 2 ) Stap 0: zoek een initieel extreem punt x (0) x 3 = x 1 x 4 = x 2 x 5 = x 1 -x 2 x 6 = x x 2

© W. Philips, Universiteit Gent, versie: 28/2/ a. 6 …Voorbeeld: simplextableau Extreem punt: x (0)= (0, 0, 1000, 1500, 1750, 4800) NB-variabelen: x 1, x 2 Maximaliseer 12 x 1 +9 x 2 waarbij NB-variabelen B-variabelen gelijkheden Simplextableau: Waarden B-variabelen in extreem punt Winstfunctie: 12 x 1 +9 x 2 x 3 = x 1 x 4 = x 2 x 5 = x 1 -x 2 x 6 = x x 2

© W. Philips, Universiteit Gent, versie: 28/2/ a. 7 Nieuw simplextableau: …Voorbeeld... x 1 = 650 +x x 6 x 4 = x x 6 x 3 = 350 -x x 6 x 2 = x x 6 Nieuwe simplex-richtingen ribbe A:  x =  (1, -2, -1, 2, 1, 0) ribbe B:  x =  (-0.5, 0.5, 0.5, -0.5, 0, 1) Nieuwe winstfunctie: 12 x x 2 = x x 6 nieuwe gelijkheden verslechterend x 3 = 350 -x x 6 x 2 = (350 -x x 6 ) x 6 x 1 = (350 -x x 6 ) x 4 = (350 -x x 6 ) x 6 Geen verbeterende ribben  optimum bereikt

© W. Philips, Universiteit Gent, versie: 28/2/ a. 8 Gevonden extreme punten …Voorbeeld: grafische voorstelling A B C D E F x1x1 x2x2 B: x 4  0 A: x 3  0 C: x 5  0 D: x 6  0 E: x 1  0 F: x 2  0 Standaardvorm: extreem punt x (0) x (2) x (3) x (4)

© W. Philips, Universiteit Gent, versie: 28/2/ a. 9 …Produceren of verder verkopen? Duaal probleem minimaliseer y 1 b 1 +  + y i b i +  + y m b m mits y 1, y 2, , y m  0, en a 11 y 1 +  + a i1 y i +  + a m1 y m  c 1 a 12 y 1 +  + a i2 y i +  + a m2 y m  c 2  a 1 n y 1 +  + a in y i +  + a mn y m  c m Primaal probleem maximaliseer c 1 x 1 +  + c j x j +  + c n x n mits x 1, x 2,..., x n  0, en a 11 x 1 +  + a 1 j x j +  + a 1 n x n  b 1 a 21 x 1 +  + a 2 j x j +  + a 2 n x n  b 2... a m 1 x 1 +  + a mj x j +  + a mn x n  b m minimaliseer b t y over y mits y  0 en A t y  c maximaliseer c t x over x mits x  0 en Ax  b