Linear Programming is a mathematical technique used to optimize a linear objective function, subject to a set of linear constraints. The formulation of an LP model involves: 

1. Decision Variables:        Represent the choices to be made.

2. Objective Function: 
        A linear function to be maximized or minimized.
3.Constraints :
        Linear inequalities or equations that restrict the values of decision variables.

Non-negativity Restrictions – Ensures variables are zero or positive, representing real-world quantities.