Analysis of the linear programming algorithms

Robert Lampreht (2014) Analysis of the linear programming algorithms. EngD thesis.

Preview

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.

Item Type:

Thesis (EngD thesis)

Keywords:

linear programming, optimization methods and algorithms, simplex method, interior-point method

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Tomaž Dobravec	258	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536115139)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

2799

Date Deposited:

26 Sep 2014 17:13

Last Modified:

16 Dec 2014 09:53

URI:

http://eprints.fri.uni-lj.si/id/eprint/2799

Actions (login required)

View Item