Techniques of operations research, Operation Research

There is no unique set of problems which can be solved by using operations Research Models r techniques. Several operations Research Models or techniques can be grouped into some basic categories as given below.

Allocation Models: Allocation Models are used to allocate recourses to activates in such a way that some measure of effectiveness (objective function) is optimized. Mathematical programming is the broad term of the operation research techniques used to solve allocation problems.

If the measure of effectiveness such as profit cost etc, is represented as a linear functions of several variables and limitations on resources ( constraints) can be expressed as a system of linear equalities or inequalities then the allocation problem is classified as a linear function of any or all of the constraints cannot be expresses as a system of linear equalities or inequalities then the allocation problem is classified as non linear programming problems.

When the solution values or decisions variables for the problem are restricted to being integer values or just zero one values the problem is classified as an integer programming problem or a zero one programming respectively.

The problem having multiple confecting and incommensurable objective functions ( goal) subject to linear constraint is called a goal programming problems. If the decisions variables in the linear programming problems depend on chance then such a problem is called a stochastic programming problem.

If the resources such as workers machines or salesmen who can be assigned to perform a certain number of activities such as jobs or territories on a one to one basis so as to minimize total time cost or distance involved in performing a given activity then such problems are classified as assignment problems. But if the activities require more than one resource and conversely if the resources can be used for more than one activity the allocation problems is classified as a transportation problems.

Posted Date: 3/20/2013 4:10:15 AM | Location : United States







Related Discussions:- Techniques of operations research, Assignment Help, Ask Question on Techniques of operations research, Get Answer, Expert's Help, Techniques of operations research Discussions

Write discussion on Techniques of operations research
Your posts are moderated
Related Questions
application&techniques


#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

In the judgement phase due care must be given to define correctly the frame of references of the operation. Objectives and values, whether economic social or aesthetic shoul

Tied Ranks Equal or Repeated Rank When  two or more  items  have equal values  it is  difficult  to give ranks  to them. In  that case  the items are given  the average of the

Z-Test Prof. Fisher has  given a method  of testing the significance of the correlation coefficient in small  samples. According  to this method the  coefficient of correlation

Decide upon  the Objective  What is it that you  aim to  achieve  the end  of the  presentation ? your  objective  should  be crystal  clear. Do  not stray or move  a ways

#question. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grad

A Company produces 150 cars. But the production rate varies with the distribution. Production Rate Probability 147 0.05 148 0.10 149 0.15 150 0.20 151 0.30 152 0.15 153 0.05 At pre

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0