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

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

Narrowing the research problem, NARROWING THE RESEARCH PROBLEM You h...

NARROWING THE RESEARCH PROBLEM You have read how from a general topic we have arrived at the definition of the problem to be studied. Now we have to narrow it down furthe

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

Sources of stress and job burnout, QUESTION Discuss the major sources o...

QUESTION Discuss the major sources of stress and job burnout and outline the strategies for managing stress. QUESTION How can you use the „Johari Window Model? as a

Sampling techniques, discuss and explain both probability and non probabili...

discuss and explain both probability and non probability sampling techniques.

Two person zero sum game, definatins and example

definatins and example

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, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Competitive models, These models have been developed to establish a trade ...

These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc

LINEAR PROGRAMMING, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages