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

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

Disadvantages of mode - measure of central tendency , Disadvantages of Mode...

Disadvantages of Mode a.It is ill defined. b.It is indefinite and it is some cases impossible to find a definite value. c.It is not based on all observation. So i

Merits - correlation regression analysis , Merits a.It is simple to ...

Merits a.It is simple to understand and easy to calculate. b.It is very useful in the case of data which are of qualitative nature like intelligence honesty be

Decision trees, Ask questioA farmer intends to drill a well for his herd. I...

Ask questioA farmer intends to drill a well for his herd. In the past, only 80% of the wells drilled in this area were successful at 12 metres of depth. On finding no water at 12 m

Knowledge - library and information services, Knowledge: The dictionar...

Knowledge: The dictionary definition of knowledge is 'organised body of information or the comprehension and understanding, consequent on having acquired an organised body of

Operations research approach to problem solving, Formulation of the Problem...

Formulation of the Problem: Before proceeding to find the solution of a problem, first of all a manager should be competent enough to form an appropriate model. To do so f

Solved the question, #questionthe following Linear Programming Problem usin...

#questionthe following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 ..

Computer aid for quantitative data analysis, Normal 0 false ...

Normal 0 false false false EN-IN X-NONE X-NONE

Introduction to Operations research, discuss applications and scope of oper...

discuss applications and scope of operations research in diverse areas.

Lpp using sipmle 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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages