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

Development of lp problems, A company manufactures 2 kinds of hats. Each ha...

A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market re

Liner programming problem, A constraints in an LPP restricts? (Value of obj...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

Modeling in operation research, what is model variables

what is model variables

Methods of calculation of standard deviation , Methods of calculation of ...

Methods of calculation of standard deviation a. Calculation of Standard Deviation - Individual Series: There are two methods of calculating standard deviation in an ind

Describe the monte carlo simulation, Question A The basic characteristic f...

Question A The basic characteristic feature of Operations Research is that it employs mathematical representations or models to analyse problems. Explain the methodology of Operat

Techniques of work measurement, Techniques of Work Measurement A n...

Techniques of Work Measurement A number of work measurement techniques have been developed to suit different types of work . There are: 1. Repetitive work: The

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

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

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

Calculation of standard deviation - discrete series, Calculation of Stand...

Calculation of Standard Deviation - Discrete Series There are three methods for calculating standard deviation in discrete series": a. Actual Mean Methods: It inc

Chi square test for the population variance, Chi square Test for the Popula...

Chi square Test for the Population variance When we want to test that a random sample has been drawn from a normal population having specified variance then X2 statist

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages