Linear Programing, 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 Programing

Theoretical framework, Ask questiAvatars are virtual characters that can be...

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

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

. 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

Nass food produce tow kinds of popular dark chocolate bars, Nass food prod...

Nass food produce tow kinds of popular dark chocolate bars

Optimization, Find a minimum cost spanning arborescence rooted,

Find a minimum cost spanning arborescence rooted,

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

Game theory-, use of game theory by state bank of india

use of game theory by state bank of india

Transportation, we have three reservoirs with daily supplies of15, 20 and 2...

we have three reservoirs with daily supplies of15, 20 and 25 litres of fresh water respectively. on each day we must supply four cities A B C D whose demands are 8 10 12 and 15 res

Competitive models, These models have been developed to establish a trade ...

These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X1+ X2 2 X1, X2 0on..

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