Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Algoritmes vir lineere programmering : 'n vergelykende studie
Tesis (M. Sc.) -- Universiteit van Stellenbosch, 1990.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | Afrikaans |
| Published: |
Stellenbosch : Stellenbosch University
2012
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613747319668736 |
|---|---|
| access_status_str | Open Access |
| author | Du Plessis, Sameul Altenstadt |
| author2 | De Kock, H. C. |
| author_browse | De Kock, H. C. Du Plessis, Sameul Altenstadt |
| author_facet | De Kock, H. C. Du Plessis, Sameul Altenstadt |
| author_sort | Du Plessis, Sameul Altenstadt |
| collection | Thesis |
| dc_rights_str_mv | Stellenbosch University |
| description | Tesis (M. Sc.) -- Universiteit van Stellenbosch, 1990. |
| format | Thesis |
| id | oai:scholar.sun.ac.za:10019.1/68645 |
| institution | Stellenbosch University (South Africa) |
| language | Afrikaans |
| last_indexed | 2026-06-10T12:41:01.634Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from SUNScholar — Stellenbosch University Repository |
| publishDate | 2012 |
| publishDateRange | 2012 |
| publishDateSort | 2012 |
| publisher | Stellenbosch : Stellenbosch University |
| publisherStr | Stellenbosch : Stellenbosch University |
| record_format | dspace |
| source_str | SUNScholar — Stellenbosch University Repository |
| spelling | oai:scholar.sun.ac.za:10019.1/68645 Algoritmes vir lineere programmering : 'n vergelykende studie Du Plessis, Sameul Altenstadt De Kock, H. C. Stellenbosch University. Faculty of Science. Dept. of Applied Mathematics. Linear programming Algorithms Simplexes (Mathematics) Parallel processing (Electronic computers) Dissertations -- Applied mathematics Tesis (M. Sc.) -- Universiteit van Stellenbosch, 1990. Since its conception in 1947 in the planning of military activities linear programming has increasingly played a leading part in decision-making. It is therefore important to have an effective solution method available. George Dantzig developed the simplex method in 1947 as a solution method for linear programming. It has been modified in many ways since and has proved to be a very effective solution method. Various non-simplex methods were developed during the last decade, e.g. Karmarkar's algorithm for linear programming. Some researchers claim that these methods are much faster than the conventional simplex type solution methods. These allegations are investigated in this project. The introduction of parallel computers during the last decade has made it possible to significantly improve on the times needed to solve linear programming problems. This is achieved by running parallel versions of the conventional (sequential) algorithms. Parallel algorithms for three simplex type solution methods are therefore also developed in this project and compared with the sequential algorithms for the simplex and non-simplex type solution methods. Masters 2012-08-27T12:26:42Z 2012-08-27T12:26:42Z 1990 Thesis http://hdl.handle.net/10019.1/68645 af Stellenbosch University 155 pagesq : ill. application/pdf Stellenbosch : Stellenbosch University |
| spellingShingle | Linear programming Algorithms Simplexes (Mathematics) Parallel processing (Electronic computers) Dissertations -- Applied mathematics Du Plessis, Sameul Altenstadt Algoritmes vir lineere programmering : 'n vergelykende studie |
| title | Algoritmes vir lineere programmering : 'n vergelykende studie |
| title_full | Algoritmes vir lineere programmering : 'n vergelykende studie |
| title_fullStr | Algoritmes vir lineere programmering : 'n vergelykende studie |
| title_full_unstemmed | Algoritmes vir lineere programmering : 'n vergelykende studie |
| title_short | Algoritmes vir lineere programmering : 'n vergelykende studie |
| title_sort | algoritmes vir lineere programmering n vergelykende studie |
| topic | Linear programming Algorithms Simplexes (Mathematics) Parallel processing (Electronic computers) Dissertations -- Applied mathematics |
| url | http://hdl.handle.net/10019.1/68645 |
| work_keys_str_mv | AT duplessissameulaltenstadt algoritmesvirlineereprogrammeringnvergelykendestudie |