linear programming problem, 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:- linear programming problem

Small sample - hypothesis testing , Small Sample The central limit ...

Small Sample The central limit  theorem does not work well  with small  samples  even if  the  population  in non Gaussian. So  we cannot  rely on the central limit theorem

Operations strategy in an organization, 1. Investigate: The Operations Str...

1. Investigate: The Operations Strategy of your organisation or one you are familiar with and answer the following points. Does your chosen organisation have an operations

What do you understand by the term operations research, Question : (a) ...

Question : (a) (i) What do you understand by the term "operations research"? (ii) Discuss three common operations research models. (b) Self-service at the university c

Objectives of measuring dispersion - measure of dispersion, Objectives of M...

Objectives of Measuring Dispersion a. To judge the Reliability  of Measures of Central Tendency: Measure of dispersion  is the  only means  to test the  representative charac

Paired sample sign test - hypothesis testing , Paired sample  sign Test ...

Paired sample  sign Test Paired samples  sign test is applied  to a situation where two sample  are taken from  two population which  have continuous symmetrical distributi

Problems, can u send me some assigment problems

can u send me some assigment problems

Classification of documents by information characteristics , Classification...

Classification of documents by information Characteristics: The schemes of classification advocated by Hanson and Grogan are mainly based on the information characteristics of

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

OR, Models in OR

Models in OR

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