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

Machine tabulation, Machine  Tabulation This methods  of tabulating i...

Machine  Tabulation This methods  of tabulating information  is generally used in  case of extensive  large scale  surveys. Mechanical sorting and tabulating equipments and su

Sequensing problem, job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10...

job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10 6 12 1 3

Coding and retrieval , Coding  and Retrieval  If all your  data ar...

Coding  and Retrieval  If all your  data are  word processed on in some  other  computer readable form  it will  be possible  for your  primary  documents  to be accessed d

Answer, 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

Components of the product, The manufacturer of the product is finding that,...

The manufacturer of the product is finding that, in order to stay competitive, a number of things need to happen: Components of the product need to be made from more sustaina

Books - report writing presentation , Books a. One author : Authors...

Books a. One author : Authors  last name  first name title  of books place of publication: publisher copyright data page numbers used. b. Two Author : First  author  la

lp-model and markov decision problem, The supply of a certain good is insp...

The supply of a certain good is inspected periodically. If an order is placed of size x >0 (integer), the ordering costs are 8+2. x. The delivery time is zero. The demand is stoc

Solve the following Linear Programming Problem using Simple , Solve the fol...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

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