Assignments, 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 aweek. 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 paperrespectively. Formulate this as a Linear Programming Problem.

Related Discussions:- Assignments

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

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 we

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

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

Multiple objectives- sampling decisions, Multiple  Objective s The sam...

Multiple  Objective s The sample  may vary according  to the  objective of the research. There  may several objectives  of marketing  research so the  sample  size  may vary a

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

. 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

Linear programming , Solve the following Linear Programming Problem using S...

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

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

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Meaning and definition, Meaning and Definition If a group  of N observ...

Meaning and Definition If a group  of N observations is  arranged in ascending or descending  order of magnitude then the  middle  value is  called  median of  these  observat

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