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

Objective of operation research, what are the objectives of operation resea...

what are the objectives of operation research?

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Factory act, what is factory act

what is factory act

Drurys principles, Drury's Principles: The basic principle, which stil...

Drury's Principles: The basic principle, which still governs the selection of reading material for a library, was enunciated by Drury in 1930. It states: "To provide the righ

Meaning and definition, Meaning and Definition If a group of N observ...

Meaning and Definition If a group of N observations is arranged in ascending or descending order of magnitude then the middle value is called median of these observat

Manner of presentation - report writing presentation, Manner of Presentatio...

Manner of Presentation Decide whether you wish to achieve your objective by a formal presentation or a non formal type of presentation. As discussed earlier the

One sample runs test - hypothesis testing, ONE SAMPLE RUNS TEST A ...

ONE SAMPLE RUNS TEST A number of methods have been developed fro judging the randomness of samples on the basis of the order in which teh observations are taken. It is

Transportation cost, factors affecting tha transportation cost

factors affecting tha transportation cost

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

Optimization, Find a minimum cost spanning arborescence rooted,

Find a minimum cost spanning arborescence rooted,

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