Linear Programming
Linear Programming
1. Objective Function:
○ The objective function represents the goal of the linear
programming problem, such as maximizing or minimizing a
certain quantity. It is a linear equation that combines decision
variables.
○ Example: Maximize Z=5x+3y\text{Maximize } Z = 5x +
3yMaximize Z=5x+3y
■ Here, ZZZ represents the quantity to be maximized (e.g.,
profit), and xxx and yyy are decision variables
representing the quantities of products or services.
2. Decision Variables:
○ These are the variables that decision-makers will determine the
values for, in order to optimize the objective function.
○ In the example above, xxx and yyy might represent the number
of units of two different products to be produced.
3. Constraints:
○ Constraints are the restrictions or limitations placed on the
decision variables. They are typically expressed as linear
inequalities or equations.
○ Constraints can represent limitations such as resource
availability, time, or other conditions that must be satisfied.
○ Example: 2x+y≤100(Resource 1)2x + y \leq 100 \quad
\text{(Resource 1)}2x+y≤100(Resource 1) x+2y≤80(Resource 2)x
+ 2y \leq 80 \quad \text{(Resource 2)}x+2y≤80(Resource 2)
x,y≥0(Non-negativity constraint)x, y \geq 0 \quad
\text{(Non-negativity constraint)}x,y≥0(Non-negativity
constraint)
■