PROBLEM , 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/26/2013 3:11:29 AM | Location : USA







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

Write discussion on PROBLEM
Your posts are moderated
Related Questions
Profitable Casino Corp. (PCC) is a Harrah's wannabe, intent on mimicking Harrah's analytical marketing techniques.  For example, PCC issues virtually all gamers a PCC "Rewards" car

Video  Tapes  Video  tapes  are very  information  and attention  grabbing  presentational  supports. They  are  best  for illustrating the  persons  in actions  and presen

Choose a publicly traded company (NYSE, AMX, or OTC) that interests you. If you don't know how to choose a company, think of IBM, DELL computer, Nike, Apple computer, GM, Ford, Nok


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

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

Deriving the Solution from the Model: This phase is devoted to the computation of those value of decision variables that maximize or minimize the objective function. Such

Provide a description of the macroeconomic environment in which the business operates noting: a) The overall 'stability' of the political system/government of the country in whi

MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - resource 1 3 X1 + 7 X2 = 175 - resource 2 X1, X2 = 0 2. How many units of resource 1 are cons

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