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

Abstract

Analiza algoritmov linearnega programiranja

Keywords

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

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [R. Lampreht]
UDC: 519.85(043.2)
COBISS: 1536115139 Link will open in a new window
Views: 89
Downloads: 11
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Analysis of the linear programming algorithms
Secondary abstract: 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.
Secondary keywords: linear programming;optimization methods and algorithms;simplex method;interior-point method;computer science;computer and information science;diploma;
File type: application/pdf
Type (COBISS): Bachelor thesis/paper
Study programme: 1000468
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 51 str.
ID: 8739540