linear proramming , 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/12/2013 11:43:35 AM | Location :







Related Discussions:- linear proramming , Assignment Help, Ask Question on linear proramming , Get Answer, Expert's Help, linear proramming Discussions

Write discussion on linear proramming
Your posts are moderated
Related Questions
A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in


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 i

Problem The important task ahead of the researcher is to document the entire work done in the form of a well-structured research report. Describe in brief the components of a R

#Principles of OR

i need many good and important question of operation research obout dinamic programing and non-liner programing and integer orograming ....for study! thank you

Introduction to Probability Distribution By  theoretical distribution we mean  a frequency distribution  which  is obtained  in relation to a random  variable by some  mathem

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

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

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.