Linear Programming Model Feasible solution space: set of all feasible combinations of decision variables as defined by the constraints. Parameters: coefficients of decision variables. Decision variables x/ = Quantity of product 1 to produce *2 = Quantity of product 2 to produce *3 = Quantity of product 3 to produce Maximize Sx1 8x2 4x3 (profit) (Objective function) Subject to Labour 2x1 4x2 8x3 250 hours (Constraints) Material 7x 6x3 5x3 100 kg Product 1 10 units 20 (Non-negativity constraints)