mb0048, Operation Research

Assignment Help:
A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF RAW MATERIALS 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:- mb0048

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

General rules, General Rules a. Attractive Shapes The tables  should ...

General Rules a. Attractive Shapes The tables  should be  neat  and  attractive. The size of  table  should be neither too big nor  small. b. Simplicity A table  should b

Investigate and examine aspects of planning structure, You are required to ...

You are required to investigate and examine aspects of planning and organisational structure for a 'real-life' organisation. This assessment enables you to relate the theories and

Wanna solution for this, A paper mill produces two grades of paper viz., X ...

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

Linear programming, A paper mill produces two grades of paper viz., X and Y...

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

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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

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

Assignment problem, a c++ program to implement assignment problem??????????...

a c++ program to implement assignment problem???????????

Observation and data collection - research phases, Observation and Data Col...

Observation and Data Collection for Better Understanding of the Problem: Many times actual observations by trained observers at the scene of operation may be difficult and da

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