Operation Research, Operation Research

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

Related Discussions:- Operation Research

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

Research paper, Research Paper Overview Research Topic: •    Research ...

Research Paper Overview Research Topic: •    Research the effects of federal mandates in your state.  Examples include the Americans with Disabilities Act, the No Child Left B

T, #Principles of OR

#Principles of OR

Goal programming, A farmer in the Midwest has 1,000 acres of land on which ...

A farmer in the Midwest has 1,000 acres of land on which she intends to plant corn, wheat, and soybeans. Each acre of corn costs $100 for preparation, requires 7 worker-days of la

De, describe the similarities and differences of transportation and linear ...

describe the similarities and differences of transportation and linear programing methods

Report writing - report writing presentation, REPORT WRITING The final...

REPORT WRITING The final step in research is to report the study  findings to those  who authorized the investigation. The American marketing association is  of the opinion  t

Mathematical Model, What is meant by a mathematical model of a real situati...

What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems

Solved a.q, Solve the following Linear Programming Problem using Simple met...

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