Home > Search Results: recid:17298
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 

Could not find similar documents for this query.
Optimization over the internet
 Šálek, Pavel ; Jablonský, Josef (advisor) ; Rada, Miroslav (referee)
The goal of this thesis is to analyse and evaluate the efficiency of systems used for solving problems of mathematical programming, which are available within the frame of project NEOS (Network Enabled Optimization Server). The most frequent algorithms for solving linear programming and mixed integer programming are described in the beginning of the work -- simplex algorithms, the interior point method, cutting plane method and branch and bound method. These algorithms are used in solvers, which are supported by NEOS server. The efficiency of the algorithms and solvers are tested on collection of chosen problems contained in libraries of NETLIB and MIPLIB.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English