UNIT I

OPERATIONS RESEARCH FORMULATION,GRAPHICALAND SIMPLEX METHODS

Main phases of O.R

1.formulation of the problems: Identify the objective 2.Construction of a mathematical model: Expressing the Messer of effectiveness which may be total profits, total cost, utility etc.. 3.Solving the model constricted: Determining the solution by analytic or iterative

4.Controling and updating: A solution which is optimum today may not be show tomorrow 5.Testing the model and its solution: Checking as for as possible either from the past available data 6.Impelementation: Impalement using the solution to achieve the desire goal

Meaning:
Linear programming problem deals with the optimization (maximization or minimization) of a function if decision variables (the variables whose value determine the solution of a problem are called decision variables of the problem) known as objective function, subject to a set of simultaneous linear equations (or inequalities) known as constraints.

Steps for lpp model;

Step 1: identify the variable Step 2: verify the constraint Step3: identify the problem & formulate Step 4: formulate objective function and subject to constraint the decision variable Step 5: identify feasible alternative

Graphical method
1.Feasible solution: Values of decision variables x suffixes to xs (j=1,2,n) which satisfies the constraints of an LPP . 2.Basic solution: For a set of M evaluation in N variables (n>m). A solution obtained by setting (n-m) variables. Equal to zero and solving for remaining M equation is called a basic solution. 3.Degenerate solution: A basic feasible solution is called Degenerate. If value of at least one basic variable is zero is called degenerate solution.

4.Non-Degenerate solution: Basic feasible solution is called Non-degenerate If values of all M basic variable are non-zero and positive. 5.Optimum basic feasible solution: A Basic feasible solution which optimizes the objective function value of the given LPP is called an optimum basic feasible solution. 6.UnBounded solution: A solution which can increase (on decrease the value of objective function of the LPP is called Unbounded solution.

DEF

DEF

DEF

UNIT II

UNIT II TRANSPORTATION MODEL

Transportation problem
MEANING: The physical distribution (Transportation) of goods & service from several supply (origin) to several demand (Destination) , to minimize the total cost time is called transportation problem. It is developed by F.L.HITCHCOCK, (1994) is a father of Transportation problem.

STEPS FOR TRANSPORTATION METHOD

1.Rim condition: In transportation problem the total supply is equal to the total demand is called Rim condition Total supply = Total demand

2.Feasable solution: A setoff non-negative values of xij which satisfies the rim condition is called a feasible solution to the transportation problem 3.Basic feasible solution: For a Transportation problem with m sources and n destination a feasible solution that contains no more than (m+n-1)

4.Optimum solution: A feasible solutionis said to be optimum. If it minimizes the total Transportation coste Min Z = Cij Xij 5. Non-Degenerate Basic feasible solution: A basic feasible solution that contains exactly m+n-1 allocation is said to be non-Degenerate Basic Feasible solution. 6. Non degenerate , when (m+n-1) = number of positive allocation in the transportation problem then it is called Non degenerate problem otherwise it is called degenerate problem 7. Balanced transportation problem: when total supply is equal to thee total demand then it is called BTP otherwise it is called Unbalanced TP if add dummy rows or columns then substitute cost as zero( Cij= 0)

Methods of Transportation problem

1.NorthWest comes rule(NWC) 2.Least cost method (LCM) 3.Vogels approximation method(VAM)

Test Optimality
Step 1: Determine initial basic feasiable solution by least cost method Step2: Find total transportation cost (TTC) Step3: Use result table with occupied (allocated) cells, substitute row u1, u2,u3 etc and column v1, v2, v3 etc

Step4: After finding u and v values to check the net evaluation. Step5: If net evaluation satisfy the condition then the total transportation cost is a same and it Indicates non-degeneracy problem. If it is not satisfied it indicates Degeneracy problem .

ASSIGNMENT PROBLEM
MEANING : The no of jobs available problem to no of machines. Each job is assigned to only one machine and each machine is assigned only one job such that the total cost is a minimum

STEPS FOR ASSIGNMENT PROBLEM

Step 1: To check the no of jobs equal to the number of machines (no. of rows = no. of columns) Step 2: From the square matrix find row minimization matrix that is each row find smallest element & subtract from each element Step3: From the result matrix do column minimization that is each column select smallest element & subtract from all element

Step 4: From the result matrix row wise maximize zero and start cancelling row wise Step5: Repeat the process & find no. of lines equal to the order of the matrix then if satisfies the condition start allocation Step 6: After allocating each row one allocation & find the total allocation of original values