0% found this document useful (0 votes)
3 views2 pages

Linear Programming

Linear Programming (LP) is a mathematical method used to optimize outcomes such as profit or resource allocation under constraints. It involves decision variables, an objective function, constraints, and a feasible region, and can be solved using graphical methods, the Simplex method, or software tools. LP has applications in various fields including production planning, logistics, and financial optimization.

Uploaded by

Eli Cosanas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views2 pages

Linear Programming

Linear Programming (LP) is a mathematical method used to optimize outcomes such as profit or resource allocation under constraints. It involves decision variables, an objective function, constraints, and a feasible region, and can be solved using graphical methods, the Simplex method, or software tools. LP has applications in various fields including production planning, logistics, and financial optimization.

Uploaded by

Eli Cosanas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

2.

Linear Programming
Definition:​
Linear Programming (LP) is a method for finding the best outcome in a mathematical model
with linear relationships, subject to constraints.

Purpose:​
To maximize profit, minimize cost, or achieve optimal resource allocation.

Components of an LP Problem:

●​ Decision Variables: What you are solving for (e.g., how many units to produce)​

●​ Objective Function: The function to be optimized (e.g., profit = 5x + 3y)​

●​ Constraints: Limitations (e.g., labor hours, material availability)​

●​ Feasible Region: Set of possible solutions satisfying all constraints​

Solving Methods:

●​ Graphical Method: For two-variable problems, visualize the solution region.​

●​ Simplex Method: For complex problems with more variables.​

●​ Software: Excel Solver, LINGO, Python (PuLP)​

Applications:

●​ Production planning​

●​ Transportation and logistics​

●​ Workforce scheduling​

●​ Diet and nutrition planning​

●​ Financial portfolio optimization​

Assumptions:
●​ Linearity in equations​

●​ Deterministic environment​

●​ Additivity and divisibility​

●​ Non-negativity of variables

You might also like