b. A paper mill produces two grades of paper viz., X and Y. , Operation Research

Assignment Help:

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 Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- b. A paper mill produces two grades of paper viz., X and Y.

Hypothesis building and testing, Hypothesis Building and Testing The...

Hypothesis Building and Testing The foundation of hypothesis building lies in discovering links between elements of your data. CAQDAS can help you to discover these links

Maths, Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Census method, Census Methods Complete Enumeration: If detail informat...

Census Methods Complete Enumeration: If detail information regarding every individual person or item of a given universe ( or population ) is collected then the enquir

Kily, krr emee ee

krr emee ee

Linear programming, Q3. Solve the following Linear Programming Problem usi...

Q3. 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

Operation Research.., 3. Explain ‘Vogel Approximation Model (VAM)’.? answer...

3. Explain ‘Vogel Approximation Model (VAM)’.? answer please

TRANSPOTATION, LIMITS OF TRANSPOTATION PROBLEM

LIMITS OF TRANSPOTATION PROBLEM

Set of pareto optimal policies, Problem: A policy maker is considering seve...

Problem: A policy maker is considering several policy options that lead to different utility levels of different individuals a) Which Policy is would be optimal according t

Application of operation reserch., how i make project report on "applicatio...

how i make project report on "application of or".i want help from you.can you give me idea to complete this report..

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages