please semd ans., Operation Research

Assignment Help:
A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- please semd ans.

Cpm/pert, how to make an attractive assignment

how to make an attractive assignment

Operations research, six operators are to be assigned to the 5 jobs with th...

six operators are to be assigned to the 5 jobs with the cost of assignments

Research abstracts, Research Abstracts Abstracts of researches comp...

Research Abstracts Abstracts of researches completed are available from the followings publications: a. ICSSR Research Abstracts: contain abstracts of research projects

Techniques of observation method, Techniques of Observation Method Obs...

Techniques of Observation Method Observation always involves some interaction between respondent and researcher in which researcher has an opportunity to watch respondent fu

Operation research, A Company produces 150 cars. But the production rate va...

A Company produces 150 cars. But the production rate varies with the distribution. Production Rate Probability 147 0.05 148 0.10 149 0.15 150 0.20 151 0.30 152 0.15 153 0.05 At pre

Principles of construction of research tool, Principles of Construction of ...

Principles of Construction of Research Tool Content of research tool should be based on aims and need of research problem: The questioning words must be concise compreh

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1.    Solve the following linear programming graphically; Maximize and minimize z = 60x+

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