Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/204320
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorRomano Rodríguez, Susana-
dc.contributor.authorLópez Ramos, Susana-
dc.date.accessioned2023-12-11T08:03:28Z-
dc.date.available2023-12-11T08:03:28Z-
dc.date.issued2023-06-08-
dc.identifier.urihttp://hdl.handle.net/2445/204320-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2023, Director: Susana Romano Rodríguezca
dc.description.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.ca
dc.format.extent48 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Susana López Ramos, 2023-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques-
dc.subject.classificationProgramació linealca
dc.subject.classificationProgramació en nombres enters-
dc.subject.classificationOptimització matemàticaca
dc.subject.classificationTreballs de fi de grauca
dc.subject.otherLinear programmingen
dc.subject.otherInteger programming-
dc.subject.otherMathematical optimizationen
dc.subject.otherBachelor's thesesen
dc.titleProgramació lineal i entera. Mètodes de resolució.ca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
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