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
Operations Research uses the methods of science to understand and explain the phenomena of operating systems. It devises the theories( models ) to explain these phenomena

Chi Square  Test Goodness of Fit Chi square test  can be used to find out  how well the  theoretical distribution fit  with the  empirical distribution  of observed distribut

STANDARA DEVIATION Standard  deviation  is the  square  root of the  arithmetic  average of  squares of all  the deviations from the  mean. In short  it may  be defined  as th

Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 x1,x2 =0

Periodical Article A periodical is a publication that is  published  periodically like  a newspaper a magazine  and a journal. Usually  periodicals have  volume numbers  and n

Word problems based on formulation of linear programming problems. 2.   A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine 1 an

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n

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