Full text
| |
| Author(s): |
Ricardo Silveira Sousa
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | São Carlos. |
| Institution: | Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB) |
| Defense date: | 2000-07-13 |
| Examining board members: |
Marcos Nereu Arenales;
Reinaldo Morabito Neto;
Aurelio Ribeiro Leite de Oliveira
|
| Advisor: | Marcos Nereu Arenales |
| Abstract | |
A linear optimization problem consists of maximizing or minimizing a linear function subject to linear constraints. Such optimization problem is, indeed, the most frequently used in production planning, resources allocation, as well as in many other aspects of decision making in industries, economy, transports, engineerings, etc. In this work the Simplex Method and some of its variants are investigated with emphasis on understanding their computational performances. (AU) | |