ASSIGNMENT PROBLEM, Operation Research

. Explain in brief the phases of Operations Research. 5 +5 = 10 marks (200 - 250 words each) Q3. Solve the following Linear Programming Problem using Simple method.
Maximize Z= 3x1 + 2X2
Subject to the constraints:
X1+ X2 = 4
X1 - X2 = 2
Posted Date: 2/10/2013 5:25:09 AM | Location : USA







Related Discussions:- ASSIGNMENT PROBLEM, Assignment Help, Ask Question on ASSIGNMENT PROBLEM, Get Answer, Expert's Help, ASSIGNMENT PROBLEM Discussions

Write discussion on ASSIGNMENT PROBLEM
Your posts are moderated
Related Questions
Assumption for  students Test a.The parent population from  which the samples is  drawn in normal. b.The sample observations  are random  i ,e the given  sample is  drawn

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 grade Y paper i

The Association of Malawi Mechanics has commissioned a study to investigate the link between engine wear and mileage. The main focus of the study is to determine whether the mileag

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 grade Y paper i

Question: (a) (i) What do you understand by the term ‘queueing theory'? Give two real life examples to illustrate your answer. (ii) Outline the five components involved in

Tentative explanations when formulated as propositions are called hypotheses. It is very important to state the hypothesis and its anticipated consequences before star

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Disadvantage  of standard Deviation It is not  easy  to understand  and calculate. It gives  more  weight  to the extremes  and less  to the items   nearer to mean. Since

The NW  corner  rule  described  earlier considers only  the availability  and supply  requirements  in making  assignments. It takes  no account  of the shipping  costs  given  in

#Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0