Formulate this as a 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:- Formulate this as a Linear Programming Problem

Environmental demands, Problem 1 Explain the key elements, which contri...

Problem 1 Explain the key elements, which contribute to a sound and effective strategy. >>Explanation of following elements Market Consumers Competition Skil

Information concept and characteristics, INFORMATION AND OTHER RELATED CONC...

INFORMATION AND OTHER RELATED CONCEPTS - THEIR MEANING AND CHARACTERISTICS: You may often hear or read in newspapers and other popular magazines about "exponential growth of i

Mip, procedure of mip

procedure of mip

Two sample tests- hypothesis testing, Two Sample Tests In some situat...

Two Sample Tests In some situation the researchers may be taking statistical decisions based on two samples. Each of the two samples may represent a particular under con

Linear programming , #questionQuestion. a paper mill produces two grades o...

#questionQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons

Considerations for oral reporting, Considerations for Oral Reporting S...

Considerations for Oral Reporting Sometimes the researcher has been asked to make an oral presentation of his research findings he should bear in mind a few major conside

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

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

LPP using Simple 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

Solve the following lpp by graphical method, A company manufactures two typ...

A company manufactures two types of printed circuits. The requirements of transistors, resistors and capacitor for each type of printed circuits along with other data are given in

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages