linear problem, Operation Research

#q
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: 2/11/2013 2:17:19 PM | Location :







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

Write discussion on linear problem
Your posts are moderated
Related Questions
main components of linear programming

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

Merits a.It is simple  to understand  and easy  to calculate. b.It is very  useful  in the  case of data which  are of  qualitative nature  like  intelligence  honesty  be

how to make an attractive assignment

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

- Please research and discuss this activity. (please cite all of the websites) - Prepare a memo on the research and evaluation. What does research and evaluation mean? Ele

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Question 1 -Though society as well as culture do not appear to be a part of business situations, yet they are actually key elements in showing how business activities will be cond

Customers arrive to a super market according to a Poisson process with intensity V = ½  per minute. The supermarket has two counters, that use a common queue. Counter 1 is always o