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

Data and information, Data and Information: The term "data" (plural fo...

Data and Information: The term "data" (plural form of datum) refers to "an individual fact, statistic, or a piece of information or a group or a body of facts, statistics or t

Linear Programming, A paper mill produces two grades of paper viz., X and Y...

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

Information concept and characteristics, INFORMATION AND OTHER RELATED CONC...

INFORMATION AND OTHER RELATED CONCEPTS - THEIR MEANING AND CHARACTERISTICS: You may often hear or read in newspapers and other popular magazines about "exponential growth of i

Title page - report writing presentation, Title  Page Tthe title page...

Title  Page Tthe title page  should  indicate  the topic  on which  the report has been  prepared the  person  or agency who has  prepared it the  person  a agency for whom it

OR, What is the role of decision making in OR

What is the role of decision making in OR

Duality, Formulation of convert to primal method to dual in lpp

Formulation of convert to primal method to dual in lpp

Optimal assingment, words each) Q2. Six Operators are to be assigned to fiv...

words each) Q2. 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 ha

Simplex method, Solve the following Linear Programming Problem using Simple...

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

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