linear programming problem, Operation Research

Assignment Help:

A paper mill produces two grades of paper viz., X and Y. Because of raw
each)
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, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas 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 a

Frequency distribution graphs, Frequency Distribution Graphs Freq...

Frequency Distribution Graphs Frequency distribution graphs may be histogram frequency polygon frequency curve ogive curve. 1. Histogram The histogram is draw f

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 in

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

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

TRANSPOTATION, LIMITS OF TRANSPOTATION PROBLEM

LIMITS OF TRANSPOTATION PROBLEM

Stratified sample size - sampling size, Stratified Sample Size The sa...

Stratified Sample Size The sampling study has depended much on the stratified sample to reduce the sampling error, samples size may have a number of strata or cluster

Duality, maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

Linear Programming Problem using Simple method, Solve the following Linear ...

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

Performance analysis of video call using skype, Description Skype i...

Description Skype is currently the most popular VoIP software in the world. Existing research has indicated that Skype can provide better voice/video quality in adverse net

Construction procedure for research tool, CONSTRUCTION PROCEDURE The c...

CONSTRUCTION PROCEDURE The construction of an interview schedule or questionnaire is a time consuming task requiring considerable attention to all the details. The investig

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages