LPP, 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:- LPP

Categories of information in social sciences, Categories of Information in ...

Categories of Information in Social Sciences: It would be useful, particularly in social sciences, to group information into three categories:  •  Statistical Information

Optimization , A company uses 4 pounds of resource 1 to make each unit of X...

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

Why the dual formulation?, Dual formulation is done for a number of r...

Dual formulation is done for a number of reasons. The solution to a Dual problem provides all essential information about the solution to the Primal problem. A so

Describe multinational corporations, Question 1 -Though society as well as...

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

Simo chart flow diagram , SIMO Chart Flow Diagram The  flow  diagram  ...

SIMO Chart Flow Diagram The  flow  diagram  is a drawing  indicating  the paths  of men  materials  or components on a scale  plan of  the work  area, department or  factory.

Operation research and decision making, Operations Research uses the meth...

Operations Research uses the methods of science to understand and explain the phenomena of operating systems. It devises the theories( models ) to explain these phenomena

Solve the following Linear Programming Problem using Simple , Solve the fol...

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

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