simplex method LPP, Operation Research

#questioA 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. n..
Posted Date: 2/8/2013 11:17:46 AM | Location : USA





please solve the problem.
Posted by avijit kundu | Posted Date: 2/12/2013 7:20:01 AM


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

Write discussion on simplex method LPP
Your posts are moderated
Related Questions
An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot

explain the procedure of MODI method of finding solution through optimaly test.

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

The town of Silverton, Colorado, has three gasoline stations, Shell, Exxon, and Arco. Customer selection of service stations can be modeled as a Markov process, with the following

give the procedure of tracing a closed loop

Secondary Periodicals: Secondary Periodicals Secondary periodicals are  abstracting and indexing periodicals.  They are also called documentation periodicals. They are a  syst

Photographs and Illustrations: Photographs and illustrations are documents which provide a visual or pictorial representation of a person, place or situation which words fail

This assignment requires you to evaluate a product from the view point of quality, both quality of design (as perceived by the user) and quality of conformance. To ensure that we a

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

what are the limitations of north west corner method