Linear programming , Operation Research

Assignment Help:
#quesQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones 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.25and 0.40 hours to produce a ton of grade z snf y psprtd. 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. tion..

Related Discussions:- Linear programming

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Demerits - correlation regression analysis, Demerits a.It cannot  be ...

Demerits a.It cannot  be used in  the case  of  bi variate distribution. b.If the  numbers  of items  are greater than say  30, the calculation becomes  tedious  and  requ

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

Necessity of operations research, After having studied as to what is op...

After having studied as to what is operations research we shall now try to answers why its need has been felt by the industry. As already tainted out science of OR came

M/M/s queue, How do I use C# to program an M/M/s queue model?

How do I use C# to program an M/M/s queue model?

Table of contents - report writing presentation, Table of contents ...

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n

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

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

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

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