Linear Programming Problem, Operation Research

Assignment Help:

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.

Related Discussions:- Linear Programming Problem

Mathematical, Ask 7:23 PM Docx Reader GROUP-7 1. A firm manufactures two pr...

Ask 7:23 PM Docx Reader GROUP-7 1. A firm manufactures two products A & B on which the profits earned per unit is Rs.3 and Rs.4. Each product is processed on two machines Miand M2.

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1. Solve the following linear programming graphically; Maximize and minimize z = 60x+

Steps involved in linear programming problem formulation, Question A - Line...

Question A - Linear Programming is most widely used technique for large number of applications in business industry as well as in various other fields. Describe in brief the steps

Problem, A paper mill produces two grades of paper viz., X and Y. Because o...

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

Linear programming examples, Solved LP Sample Assignment & Questions A ...

Solved LP Sample Assignment & Questions A person desires to decide the ingredients of a diet which will satisfy his routine necessities of fats, proteins, and carbohydrates at

Mk, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Reference books - classification of documents, Reference Books: Defini...

Reference Books: Definition According to William Katz (1969) a Reference book generally has the following qualities: It is a miscellany of information organised for quick

Big M method, Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

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

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages