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

Stratified sample size - sampling size, Stratified Sample Size The sa...

Stratified Sample Size The sampling study has depended much on the stratified sample to reduce the sampling error, samples size may have a number of strata or cluster

Periodical article - report writing presentation , Periodical Article ...

Periodical Article A periodical is a publication that is published periodically like a newspaper a magazine and a journal. Usually periodicals have volume numbers and n

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?

Research, Discus and explain both probability and none probability sampling...

Discus and explain both probability and none probability sampling techniques

Limitation - report writing presentation, Limitation The report s...

Limitation The report should also point out the main limitation of the research reported therein. This will be helpful to the reader who can form his own opinion

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

Lpp, a paper mill prodecs two grades of paper viz., X and Y. Because of raw...

a paper mill prodecs 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

Answer, explain operation research with example.and also discuss the scope ...

explain operation research with example.and also discuss the scope of OR in modern management.

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Simplex method, Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 x1,x2 =0

Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 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