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

Scope, Scope of operation research?

Scope of operation research?

Purchasing, need of detailed information about the topic

need of detailed information about the topic

Post-optimal analysis, It can be seen from the optimal solution for the fou...

It can be seen from the optimal solution for the foundry problem that two resources, raw material-1 and labor, are exhausted whereas the other two resources, raw materi

Methods of scientific research, Methods is a tool or a techniques used t...

Methods is a tool or a techniques used to collect data. It is procedure for obtaining knowledge based on empirical observation and logical reasoning. Field Study Metho

Type of measures of dispersion - measure of dispersion, Type  of  Measur...

Type  of  Measures  of Dispersion   a. Absolute Measure: The measure of dispersion which  is expressed in  terms of the units of the  observations( e, g, Rupees , metre ,

Other determinants of sample size- sampling decisions, Other  Determinants ...

Other  Determinants  of Sample Size 1. The variability  of elements  within the population  has become  a  very  important  factor  to decide the  sample  size.    The more  v

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Research process and methodology , Case Study - Research Process Tomz...

Case Study - Research Process Tomzak  and Hale  inc was a medium sized  marketing  research firm  located  in a large mind western  city. Bob Lynn a marketing  vice president

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 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