linear problem, Operation Research

#q
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/11/2013 2:17:19 PM | Location :







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

Write discussion on linear problem
Your posts are moderated
Related Questions
Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

#queSix 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 assign

Degree of  Correlation ship 1. Perfect Correlation: When  changes  in  two related variables are  exactly  proportional  there is  perfect correlation between  them. In case

Operation research is only a Tool of Analysis and Not the Complete Decision making Process: It should always be kept in mind that O. R alone cannot make the final decision . it

Provide a description of the macroeconomic environment in which the business operates noting: a) The overall 'stability' of the political system/government of the country in whi

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

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

Secondary Periodicals: Secondary Periodicals Secondary periodicals are  abstracting and indexing periodicals.  They are also called documentation periodicals. They are a  syst

Decide upon  the Objective  What is it that you  aim to  achieve  the end  of the  presentation ? your  objective  should  be crystal  clear. Do  not stray or move  a ways

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z