linear progaming, Operation Research

#questA 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.ion..
Posted Date: 2/19/2013 1:13:57 AM | Location : USA







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

Write discussion on linear progaming
Your posts are moderated
Related Questions
in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the ga

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints


A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

Oral Presentation At times  oral presentation of the  results of the study is considered effective particularly in case where  policy recommendations are indicated by project

Rules  Regarding the Table  Structure a. Table Number: When a number  of tables  are constructed serial number of the tables  should  be given  to each table. b. Title Th

basic requirements for solving linear programing using simplex method

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

These models are used for analyzing a system which changes over a period of time among various possible outcomes or states. The models while dealing with such systems describe tra

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli