Romano Rodríguez, SusanaLópez Ramos, Susana2023-12-112023-12-112023-06-08https://hdl.handle.net/2445/204320Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2023, Director: Susana Romano Rodríguez[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.48 p.application/pdfcatcc-by-nc-nd (c) Susana López Ramos, 2023http://creativecommons.org/licenses/by-nc-nd/3.0/es/Programació linealProgramació en nombres entersOptimització matemàticaTreballs de fi de grauLinear programmingInteger programmingMathematical optimizationBachelor's thesesinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess