SMU 2nd Semester, Operation Research

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
Posted Date: 2/14/2013 1:52:14 AM | Location : China







Related Discussions:- SMU 2nd Semester, Assignment Help, Ask Question on SMU 2nd Semester, Get Answer, Expert's Help, SMU 2nd Semester Discussions

Write discussion on SMU 2nd Semester
Your posts are moderated
Related Questions
The scientific methods is based on certain article of path these are: 1. Reliance on Evidence: Truth is established on the basis of evidence. Conclusion is admitted onl

Importance of Normal Distribution Normal distribution  plays  a very  important  role in  statistical  theory  and in  particular  in sampling theory. It has  been  found  th

Considerations for Oral Reporting Sometimes  the researcher has been asked to  make an oral presentation of his  research findings he should  bear in mind a few major  conside

Each day you own 0 or 1 stocks of certain commodity. The price of the stock is a stochastic process that can be modeled as a Markov chain with transition rates as follows


Advantages of Standard  deviation a.Standard  deviation is based on all the observations and is rigidly  defined. b.It is  amenable to algebraic  treatment  and possesses

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

Problem: A policy maker is considering several policy options that lead to different utility levels of different individuals a) Which Policy is would be optimal according t

Question 1 A) Differentiate among descriptive and inferential analysis of data B) Describe with examples various measures of Central Tendency Question 2 The chi-square

#question.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.