Need help on Operation Research? This document provides in-depth discussion of the topics, codes on linear programming along with a list of common questions that may pop up in the exams.

Slide 1




Profit = Revenue - Cost

At Breakeven point, Revenue = Cost
So, Profit = R-C = 0


Linear programming involves choosing a course of action when the
mathematical model of the problem contains only linear functions. (no
powers of x; straight line equation)

e.g y = 2x +3 is a linear function

y = x2 is a nonlinear function


Our objective is to maximize or minimize some quantity

All linear programming problem involves some constraints

A feasible solution satisfies all the problem’s constraints



Prepared by Ridwan Abrar

, An optimal solution is a feasible solution that results in the largest
possible value of the objective function when maximising (or smallest
possible value when minimising)

A graphical solution method can be used to solve a linear program with
two variables.

Dealing with a linear programming model:
**Find out objective, constraint and decision variables (x,y, S)
Decision variable = unknown

Write objective in terms of decision variables (equation)
Write constraint in terms of decision variables (inequality)
Constraint includes inequalities

Par Inc.


Prepared by Ridwan Abrar