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

OPERATION RESEARCH, A paper mill produces two grades of paper viz., X and Y...

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

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

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

#titleHungaran method.., how to use the hungarian method

how to use the hungarian method

Experimental method, In this method variables beings studied are contro...

In this method variables beings studied are controlled by the investigator. In other the effect of one variable is observed while other relevant variables are held constant

Some guidelines for bibliography entries , Some Guidelines for Bibliograp...

Some Guidelines for Bibliography Entries 1. Reference of a Back by One Authors : Mention authors name book title ( in italics hence to be underlined) city publication

Pert and cpm, what is pert and cpm?

what is pert and cpm?

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

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

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

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

Linear programming , A paper mill produces two grades of paper viz., X and ...

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

Goal programming, Goal Programming This provides a more realistic model...

Goal Programming This provides a more realistic model. In a modern setting, profit maximization may not be the only objective of a business concern. Other objectives or goals c

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