diplomsko delo
Robert Lampreht (Avtor), Tomaž Dobravec (Mentor)

Povzetek

Analiza algoritmov linearnega programiranja

Ključne besede

linearno programiranje;optimizacijske metode in algoritmi;metoda simpleksov;metoda notranjih točk;računalništvo;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Podatki

Jezik: Slovenski jezik
Leto izida:
Tipologija: 2.11 - Diplomsko delo
Organizacija: UL FRI - Fakulteta za računalništvo in informatiko
Založnik: [R. Lampreht]
UDK: 519.85(043.2)
COBISS: 1536115139 Povezava se bo odprla v novem oknu
Št. ogledov: 89
Št. prenosov: 11
Ocena: 0 (0 glasov)
Metapodatki: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Ostali podatki

Sekundarni jezik: Angleški jezik
Sekundarni naslov: Analysis of the linear programming algorithms
Sekundarni povzetek: The use of linearprogramming today is very wide spread because of useful optimizations problems that can solve. Some of the more important industries that are using optimization methods are: logistics, telecommunications and manufacturing. The objective of linear programming is optimization of complex problems with algorithms. In out thesis we want to introduce different types of optimization algorithms and how they work. Our main focus will be on simplex method and interior-point method. For testing purposes we will use standardized test set for optimization problems. With given results we will try to decide which optimization method is better suited for the job.
Sekundarne ključne besede: linear programming;optimization methods and algorithms;simplex method;interior-point method;computer science;computer and information science;diploma;
Vrsta datoteke: application/pdf
Vrsta dela (COBISS): Diplomsko delo/naloga
Študijski program: 1000468
Komentar na gradivo: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Strani: 51 str.
ID: 8739540