Different types of Linear Programming Problems|Examples

Mathematical Formulation of Linear programing problem(Example)

Solve the Following Linear Programming Problem graphically: Maximise Z=3x+2y subject to x+2y =0

Solve the Following Linear Programming Problem graphically: Minimise Z=-3x+4y Subject to x+2y =0,y>=0

Solve the Following Linear Programming Problem graphically: Maximise Z=3x+4y subject to the constraints : x+y =0,y>=0

Solve the Following Linear Programming Problem graphically: Maximise Z=5x+3y subject to 3x+5y =0,y>=0

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called A)linear relations B) constraints C) functions D) objective functions