SMU 2nd Semester, 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:- SMU 2nd Semester

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

#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

Trade literature - classification of documents, Trade Literature: Trad...

Trade Literature: Trade literature consists of documents that give information on the processes and materials involved in the manufacture of a product, various types of produc

Assignment, discuss about assignment and steps involved in it

discuss about assignment and steps involved in it

DECISION MODELS, CRITICAL EXAMINATION OF THE APPLICATION OF DECISION THEORY...

CRITICAL EXAMINATION OF THE APPLICATION OF DECISION THEORY TECHNIQUES OR MODEL IN BUSINESS DECISION MAKING IN NIGERIA

Methods of survey and study, Methods of Survey and Study:   Some method...

Methods of Survey and Study:   Some methods of collecting information about the organisation and about the information requirement of potential users are mentioned below. No si

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

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

RJR NABISCO, WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN...

WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN IN THIS SITUATION

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

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