linear programming, Operation Research

B 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
Posted Date: 2/17/2013 9:22:54 AM | Location : USA







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

Write discussion on linear programming
Your posts are moderated
Related Questions
1) Provide an overall description of the business and the competitive environment in which it operates.  You should describe: a) what type of business it  is (e.g. retail, manuf

Problem 1 (Problem 23, page 507) At a machine tool plant, five jobs must be completed each day. The time it takes to do each job depends on the machine used to do the job. If a mac

#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

Steps of Research Proposal Proposal Content  The researcher is always given instructions for preparing a proposal that indicate the format to be followed. Funding agencie

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

3 In a rectangular game, pay-off matrix of player A is as follows:

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

In a rectangular game, pay-off matrix of player A is as follows: Player B B1 B2 Player A A1 A2 i) Solve the game. ii) Write down the pay-off matrix of B and th

.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

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