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

Scope of operation research, scope of operation research in management

scope of operation research in management

Assignments, A paper mill produces two grades of paper viz., X and Y. Becau...

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

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

. 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

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

Objectives of strategic management, Problem What are important objectiv...

Problem What are important objectives of strategic management and the causes for failure t of strategic management Objectives To keep pace with the changing business e

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

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Demands of logic and objective procedure, The scientific methods is thus ...

The scientific methods is thus based on certain basic postulate which can be stated as under: a. It relies on empirical evidence: b. It utilizes relevant concepts;

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages