linear programming, Operation Research

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
Posted Date: 2/10/2013 2:53:34 AM | Location :







Related Discussions:- linear programming, Assignment Help, Ask Question on linear programming, Get Answer, Expert's Help, linear programming Discussions

Write discussion on linear programming
Your posts are moderated
Related Questions
Line Balancing Methods - Heuristic Approach  Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so

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

Government Documents: Government  publications are the official documents brought out at government expense. They are the records of activities of the (1) Executive, (2) Legis

Discuss the methodology of operation research

Operations Research uses the methods of science to understand and explain the phenomena of operating systems. It devises the theories( models ) to explain these phenomena


is model the essence of oprational research.

Decision making is not only the headache of management rather all of us make decisions. We daily decide about minor issues. The essential characteristics of all decisions

factors affecting tha transportation cost

we have three reservoirs with daily supplies of15, 20 and 25 litres of fresh water respectively. on each day we must supply four cities A B C D whose demands are 8 10 12 and 15 res