LPP FORMULATION., 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:- LPP FORMULATION.

Research design and methodology , Case Study - Research Design RJR N...

Case Study - Research Design RJR Nabisco Ever since the health aspects  of smoking  became  a public  issue  shortly after world war II the tobacco industry knew there

Considerations for oral reporting, Considerations for Oral Reporting S...

Considerations for Oral Reporting Sometimes  the researcher has been asked to  make an oral presentation of his  research findings he should  bear in mind a few major  conside

Knowledge - library and information services, Knowledge: The dictionar...

Knowledge: The dictionary definition of knowledge is 'organised body of information or the comprehension and understanding, consequent on having acquired an organised body of

ASSIGNMENT ANSWER, Six Operators are to be assigned to five jobs with the c...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Two sample tests- hypothesis testing, Two Sample Tests In some  situat...

Two Sample Tests In some  situation the researchers may be taking  statistical decisions based on two samples. Each  of the  two  samples may  represent a particular under con

Linear programing, Solve the following Linear Programming Problem using Sim...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

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

Case Analysis, Ask question #Minimum 100 woRead this article and then write...

Ask question #Minimum 100 woRead this article and then write a three-page summary of the application (problem definition, objective function constraints, decision variables, etc.)

Linear programmimg, #questionA paper mill produces two grades of paper viz....

#questionA 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 grad

Identify the various ways of selecting a random sample, Question 1 Discuss...

Question 1 Discuss the types of measurement scales used in research Question 2 Identify the various ways of selecting a random sample Question 3 Discuss five advan

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