Linear Programming , 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:- Linear Programming

LPP, A paper mill produces two grades of paper viz. X and Y. Because of raw...

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

Classification of models, what are the classifications of operations resea...

what are the classifications of operations research?

Linear programming problem, A paper mill products two grade of paper viz., ...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Use of t -tables - hypothesis testing , Use of t -tables            ...

Use of t -tables            Similar  to normal  curve  tables  there  exist t- distribution  tables. However  whereas the properties of  the normal  curve are constant for all

Simple size -sampling decisions, simple Size When a survey  is underta...

simple Size When a survey  is undertaken and  it is not  possible  to cover  the entire population, the marketing  researcher has to  answer a basic  question  - how  large  s

Operations function - information system, The Operations Function has alway...

The Operations Function has always relied heavily on information for its smooth running. During this course information has been introduced as one of the five inputs to the convers

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

Linear programming problem, Solve the following Linear Programming Problem ...

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

Linear Programming, b. A paper mill produces two grades of paper viz., X an...

b. 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 pape

Rephrasing the research problem, Rephrasing the Research Problem Final...

Rephrasing the Research Problem Finally as a researcher you should rephrase the research problem. Once you have followed all the four steps above, i.e., 1) You have clear

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