LPP FORMULATION., 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:- LPP FORMULATION.

Research an issue related to computer networks, Assignments should be submi...

Assignments should be submitted via FLO by the above deadline. Penalties for late submission are as set out in the topic SAM on FLO. Extensions can be granted in line with standard

Linear Programming, b. A paper mill produces two grades of paper viz., X an...

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 pape

Scope, Scope of operation research?

Scope of operation research?

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

Examine the future sustainability of business, In your role as a Consultant...

In your role as a Consultant to a renowned organisation or institution, you have been asked to design and submit a research proposal to examine the future sustainability of its bus

Techniques of work measurement, Techniques  of Work  Measurement A n...

Techniques  of Work  Measurement A number of work  measurement  techniques  have been  developed  to suit  different  types of work . There are: 1. Repetitive work: The

Linear programming model, Nass food produces to kinds of popular dark choco...

Nass food produces to kinds of popular dark chocolate bars. The banana and the coffee.the

Sequencing problem, if one no. is repeated 2-3 times in machine-1 and machi...

if one no. is repeated 2-3 times in machine-1 and machine-2 what is to be prefer first

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

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