Linear Programming Problem, Operation Research

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

Identify and comment on cultural similarities, You are required to analyse ...

You are required to analyse the case study, as indicated under these headings: 1. Identify FIVE persons, bodies, organisations or groups in the case study. 2. For EACH of the

Theoretical framework, Ask questiAvatars are virtual characters that can be...

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

Methodology, what are the methodology of operation research

what are the methodology of operation research

Least cost method , definitions procedure and example

definitions procedure and example

Transportation problem, scope of operation research

scope of operation research

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

Linear programing, main components of a linear programming

main components of a linear programming

One sample tests- hypothesis testing , One Sample Tests The one sample...

One Sample Tests The one sample test is applied to a situation where only a single sample ( one sample) is taken from a population in this test the researcher may be tak

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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

Modi, explanation

explanation

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