• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.3.1977.tde-24052024-151944
Document
Author
Full name
Reynaldo Brown do Rego Macedo
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 1977
Supervisor
Committee
Novaes, Antonio Galvão Naclério (President)
Ellenrieder, Alberto Ricardo Von
Mariotto, Mario
Title in Portuguese
Dimensionamento de uma frota de graneleiros por meio de programação linear.
Keywords in Portuguese
Afretamento de navios
Armador
Graneis
Modelo matemático linear
Abstract in Portuguese
Neste estudo é estabelecido um modelo matemático linear que representa o problema de decisão de um armador que opera com graneis, referente à aquisição e afretamento de navios para sua frota e, paralelamente, à operação da frota resultante. A solução ótima do problema é obtida através do simplex original com variáveis limitadas superiormente. Tendo-se chegado a um modelo linear misto algumas considerações são feitas sobre o emprego da técnica do branch and bound para a solução completa do problema.
Title in English
Untitled in english
Keywords in English
Bulk
Linear mathematical model
Ship charter
Shipowner
Abstract in English
In this study a linear mathematical model is established representing the decision problem of a shipowner who operates with bulk cargoes, regarding the aquisition and freighting of ships for his fleet and, at the same time, the operation of the resulting fleet. The optimum solution of the problem is achieved using the original simplex sith upper limits on some variables. Since the final linear model turned out as a mixed type one, some considerations were then made about the use of the branch and bound technique for getting the full solution of the problem.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2024-05-27
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2024. All rights reserved.