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 1.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 grade Y respectively. Formulate this as a linear programming problem.

Related Discussions:- Linear Programming Problem

Analytical and decision- making skills, This assessment aims to provide stu...

This assessment aims to provide students with the opportunity to hone their analytical and decision- making skills. It also aims to help students develop their ability to think cre

Use of the graphs, Use of the Graphs a . It simplifies the complexi...

Use of the Graphs a . It simplifies the complexities of large numbers or that of large mass of data. In general graphical or some other method or representation is ad

Linear programming, nass food produces to kinds of popular dark chocolate b...

nass food produces to kinds of popular dark chocolate bars.the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where as the coffee bar costs 0.40 to make an

Demerits of range - measure of dispersion , Demerits of Range a.It g...

Demerits of Range a.It gives importance to the two extreme values and is very much affected by the extreme items. b.The range provides no information about the st

the simplex method, In large sized linear programming problems, the ...

In large sized linear programming problems, the solution cannot be obtained by the graphical method and hence a more systematic method has to be developed to find

Pay-off matrix , In a rectangular game, pay-off matrix of player A is as fo...

In a rectangular game, pay-off matrix of player A is as follows: Player B B1 B2 Player A A1 A2 i) Solve the game. ii) Write down the pay-off matrix of B and th

Type of operation resarch, what are the different types

what are the different types

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Business Simulation Model, How much does cost for developing a simple model...

How much does cost for developing a simple model using Simuli 8 software and 2 pages write up (Explaining model). This is for my university assignment. For example last year assig

Optimization, Find a minimum cost spanning arborescence rooted,

Find a minimum cost spanning arborescence rooted,

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages