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

Decision tree approach, Question: Spencerville Products is expanding ...

Question: Spencerville Products is expanding its operations west of the Mississippi. Its first step is to build a manufacturing facility in Denver to satisfy demand on the W

Sample survey methods:, Sample Survey Methods: If proposed investigati...

Sample Survey Methods: If proposed investigation is done only on a part taken out of universe then it will be known as sample survey. This part of the universe is kno

Linear Programming, A paper mill produces two grades of paper viz., X and Y...

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

Differentiate among descriptive and inferential analysis o, Question 1 ...

Question 1 A) Differentiate among descriptive and inferential analysis of data B) Describe with examples various measures of Central Tendency Question 2 The chi-square

Transportation problem, NWCR

NWCR

Cross cultural communication in the workplace, This assignment requires you...

This assignment requires you to carry out the first part of a research project on the topic of "Cross cultural communication in the workplace". You can take any approach to this to

Simplex method, how to use simples method

how to use simples method

Deviation taken from assumed mean, Deviation Taken from Assumed Mean ...

Deviation Taken from Assumed Mean This methods is assorted when the arithmetic average is a fractional value. Taking deviation from fractional value would be a ver

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 0

Linear programming, #questiA paper mill produces two grades of paper viz X ...

#questiA 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 pa

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages