Answer, 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:- Answer

Deviation taken from assumed mean, Deviation Taken from Assumed Mean ...

Deviation Taken from Assumed Mean This methods  is assorted  when the  arithmetic  average  is a  fractional value. Taking  deviation from  fractional value would  be a ver

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

Hypothesis building and testing, Hypothesis  Building and Testing The...

Hypothesis  Building and Testing The foundation of hypothesis building  lies in discovering links between  elements  of your data. CAQDAS can help you to  discover these links

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

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

Competitive models, These models have been developed to establish a trade ...

These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc

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

Policies, POLICIES, NORMS AND STANDARDS: Information source; building,...

POLICIES, NORMS AND STANDARDS: Information source; building, an important function of the library, should be based on sound policies and programmes.  The basic question of

Linear programming problem, #Solve the following Linear Programming Problem...

#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

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