linear programming problem, 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 problem

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

Lcd projectors - reoprt writing presentation , LCD Projectors  LCD...

LCD Projectors  LCD projectors  are several  steps  ahead of conventional OHPs. These  projectors  are more  compact  and more  powerful  and can  be directly  linked to a

Decide upon the objective , Decide upon  the Objective  What is it...

Decide upon  the Objective  What is it that you  aim to  achieve  the end  of the  presentation ? your  objective  should  be crystal  clear. Do  not stray or move  a ways

Sequencing, how the sequencing techniques help the manager

how the sequencing techniques help the manager

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

Reference books - classification of documents, Reference Books: Defini...

Reference Books: Definition According to William  Katz (1969) a Reference book generally has the following qualities:  It is a miscellany of information organised for quick

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Linear programming, 3. A paper mill produces two grades of paper viz., X an...

3. 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

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