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

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

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

what will happen when line balance doesn not exist

Linear programing, main components of a linear programming

main components of a linear programming

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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 i

1, A paper mill produces two grades of paper viz., X and Y. Because of raw ...

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 i

SIGNIFICANCE OF OPERATION RESEARCH, WHAT ARE THE SIGNIFICANCE OF OPERATION ...

WHAT ARE THE SIGNIFICANCE OF OPERATION RESEARCH

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Case Analysis, Ask question #Minimum 100 woRead this article and then write...

Ask question #Minimum 100 woRead this article and then write a three-page summary of the application (problem definition, objective function constraints, decision variables, etc.)

Linear programming., Q3. Solve the following Linear Programming Problem usi...

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

Decide upon the objective , Decide upon the Objective What is it...

Decide upon the Objective What is it that you aim to achieve the end of the presentation ? your objective should be crystal clear. Do not stray or move a ways

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