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

Relationship between media producers and audiences, 1. We have looked at a ...

1. We have looked at a number of theories explaining the nature of the relationship between media producers and audiences. Give a detailed description of at least three of these ap

Model building is the essence of the operations research app, Model buildin...

Model building is the essence of the operations research approaches?

Replacement, an electric company which generates and distributes electricit...

an electric company which generates and distributes electricity conducted a study on the life of poles. tha appropriate life data are given in the following table: years after inst

Properties of normal distribution - probability distribution, Properties of...

Properties of Normal Distribution a.It is a continuous  probability  distribution having  parameters m and . b.The normal  curve is perfectly symmetrical about  the mean (

Disadvantages of mode - measure of central tendency , Disadvantages of Mode...

Disadvantages of Mode a.It is  ill defined. b.It is  indefinite  and it is  some cases impossible  to find a definite  value. c.It is not based on all observation. So  i

Limitations of operational researchers, Among other limitations of O. R the...

Among other limitations of O. R the followings deserve mention: a. Basis: The operational researchers must be unbiased. An attempt to shoehorn result sin to a confirmation of ma

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

Research methodology, Research Methodology 1. Discuss how the researc...

Research Methodology 1. Discuss how the research will be executed to achieve the proposed research objectives. The methodology should be based on the methods that are used in

Graphs of time series, Graphs of Time Series A time  series  is a sequ...

Graphs of Time Series A time  series  is a sequence of values  corresponding  to successive points  of time. Time  series  are  graphed  with time  on the x axis  and the  oth

Higher order table, Higher Order  Table   When  three  or more  charac...

Higher Order  Table   When  three  or more  characteristics are represented in the same  table such a table  is called  higher order table. The  need  for such  a table arises

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