LPP, Operation Research

Assignment Help:
A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 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 200 and 500 per ton of grade Xand Y paper respectively. Formulate this as a Linear programming problem

Related Discussions:- LPP

MB0048, 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 i

Cost- sampling decisons, Cost The  cost factor  is a very  importan...

Cost The  cost factor  is a very  important  factor in determining  the size of the  sample. The budget for research should be properly  decided. The management may not lik

Game thoery, In a rectangular game, pay-off matrix of player A is as follow...

In a rectangular game, pay-off matrix of player A is as follows: i) Solve the game. ii) Write down the pay-off matrix of B and then, solve the game.

Verification of hypothesis, Analysis of Available Information and Verific...

Analysis of Available Information and Verification of Hypothesis: most of the time that a scientist spends in training is devoted to learning how to analyze and int

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Chi square test goodness of fit- hypothesis testing, Chi Square  Test Good...

Chi Square  Test Goodness of Fit Chi square test  can be used to find out  how well the  theoretical distribution fit  with the  empirical distribution  of observed distribut

Markov chain models - operation research model, These models are used for a...

These models are used for analyzing a system which changes over a period of time among various possible outcomes or states. The models while dealing with such systems describe tra

Linear programimg, Solve the following Linear Programming Problem using Si...

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