Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/204320
Title: Programació lineal i entera. Mètodes de resolució.
Author: López Ramos, Susana
Director/Tutor: Romano Rodríguez, Susana
Keywords: Programació lineal
Programació en nombres enters
Optimització matemàtica
Treballs de fi de grau
Linear programming
Integer programming
Mathematical optimization
Bachelor's theses
Issue Date: 8-Jun-2023
Abstract: [en] The main goal of this work is to study Lineal Programming problems with and without variables restricted to integer values. To do so, we study the feasible solutions set as a convex polyhedron and we look for the feasible optimal solutions on its vertexes. This work explains the Simplex algorithm to solve these problems. It also details two different methods to solve problems with variables restricted to integer values.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2023, Director: Susana Romano Rodríguez
URI: http://hdl.handle.net/2445/204320
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
tfg_susana_lopez_ramos.pdfMemòria560.61 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons