LPP FORMULATION., Operation Research

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 in a week. There are 160 production hours in a week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paper respectively. Formulate this as a Linear Programming Problem.
Posted Date: 1/31/2013 12:24:51 AM | Location : USA







Related Discussions:- LPP FORMULATION., Assignment Help, Ask Question on LPP FORMULATION., Get Answer, Expert's Help, LPP FORMULATION. Discussions

Write discussion on LPP FORMULATION.
Your posts are moderated
Related Questions
In large sized linear programming problems, the solution cannot be obtained by the graphical method and hence a more systematic method has to be developed to find

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

role of computer software operation research

Method of Concurrent Deviations The  coefficient  of concurrent  deviation or coefficient  of correlation  b the concurrent deviation  methods  is given  by the formula. R

In a rectangular game, pay-off matrix of player A is as follows: i) Solve the game. ii) Write down the pay-off matrix of B and then, solve the game.

write the scope of operation research

Two Sample Tests In some  situation the researchers may be taking  statistical decisions based on two samples. Each  of the  two  samples may  represent a particular under con

what will happen when line balance doesn not exist

General Rules a. Attractive Shapes The tables  should be  neat  and  attractive. The size of  table  should be neither too big nor  small. b. Simplicity A table  should b

#queSix Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assign