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

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

Game theory, #question:explain the theory of dominance in the solution of r...

#question:explain the theory of dominance in the solution of rectangular games?

Analyse the average number and mean number, Consider the closed network of ...

Consider the closed network of the following figure. The number at the arrows give the transition probabilities for a customer leaving the queue to route to a subsequent queue. Eve

Methods of scientific research, Methods is a tool or a techniques used t...

Methods is a tool or a techniques used to collect data. It is procedure for obtaining knowledge based on empirical observation and logical reasoning. Field Study Metho

Investigate and examine aspects of planning structure, You are required to ...

You are required to investigate and examine aspects of planning and organisational structure for a 'real-life' organisation. This assessment enables you to relate the theories and

Steps involved in linear programming problem formulation, Question A - Line...

Question A - Linear Programming is most widely used technique for large number of applications in business industry as well as in various other fields. Describe in brief the steps

Linear programming problem, Solve the following Linear Programming Problem ...

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

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

Line balancing, what will happen when line balance doesn not exist

what will happen when line balance doesn not exist

Liner programming problem, A constraints in an LPP restricts? (Value of obj...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages