a paper mill produces, Operation Research

Assignment Help:
. 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.

Related Discussions:- a paper mill produces

Categorizing operations research problems, what are the categorization of o...

what are the categorization of operations research problems?

Determination of the operation, An operation is a combination of different...

An operation is a combination of different actions dealing with raw materials( e, g, men and machines) which form a structure from which an action with regard to broader ob

#, Six Operators are to be assigned to five jobs with the cost of assignmen...

Six 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 assignment

Research paper, Research Paper Overview Research Topic: •    Research ...

Research Paper Overview Research Topic: •    Research the effects of federal mandates in your state.  Examples include the Americans with Disabilities Act, the No Child Left B

Queuing theory, A certain type of machine breaks down at an average rate of...

A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

Lpp, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Operation Research.., 3. Explain ‘Vogel Approximation Model (VAM)’.? answer...

3. Explain ‘Vogel Approximation Model (VAM)’.? answer please

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

Presentation - report writing presentation , Presentation After  the c...

Presentation After  the completion of any  research  project the concept  techniques  and results  of the  research  projects  should  be presented to the  audience of interes

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd