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

Effect of professional development on class management, Purpose: The pu...

Purpose: The purpose of this study is to explore the effect of professional development on teachers' Lesson Planning, Class Management, Teaching Methods, Cooperation and Teac

Operations Research, a. What do you mean by linear programming problem? Exp...

a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X and Y.

Solve by computational procedure of big – m method, Example 2 Max Z = 3...

Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A

One sample sign test - hypothesis testing , One Sample sign Test In...

One Sample sign Test In a one  sample  test the  null  hypothesis μ = μ 0 against an  appropriate alternative on the basis of a random sample of size n we replace each sam

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

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

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Graphic , max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x...

max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x1+2x2 X1+x2. >_ o

Write Your Message!

Captcha
Free Assignment Quote

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd