Professional Documents
Culture Documents
Informe en Inglés - Matemática
Informe en Inglés - Matemática
ACCOUNTING SCHOOL
COURSE:
MATH
AUTHOR:
TEACHER:
2023
ÍNDICE
I. INTRODUCTION
II. DEVELOPMENT
III. BIBLIOGRAPHIC REFERENCES
ANNEXES
INTRODUCTION
Linear programming is a mathematical method used
to optimize the allocation of resources and solve
decision-making problems. It involves maximizing or
minimizing a linear objective function, subject to a set
of linear constraints. The graphical method is one of
the techniques used to solve linear programming
problems visually. By plotting the constraints on a
graph, the feasible region is determined, and the
optimal solution can be identified by finding the point
that maximizes or minimizes the objective function.
This method provides a visual representation of the
problem, making it easier to understand and analyze
the results.
DEVELOPMENT
Linear programming refers to several mathematical
techniques used for the optimal allocation of limited
resources to different demands that compete for
them (Chase, Jacobs and Aquilano. 2009), it is an
optimization technique that seeks to maximize or
minimize a linear function, called function objective,
subject to linear restrictions (Álvarez. 2005).
Linear programming originated after the Second
World War. In 1947, George Dantzing developed
research and applications to solve linear
programming problems in military operations. Since
its inception, this tool has been used to solve
optimization problems in different spaces; nowadays,
companies face all kinds of problems, which put their
economic stability and continuity in the market at
risk, so entrepreneurs are always in search of
efficient and fast feasible solutions, whose processes
are managed through linear programming, which
plans activities to achieve better results among the
solution alternatives. (Marín and Maya 2016).