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

Significance, significance of operation research in modern management

significance of operation research in modern management

Graphical method- minimization example, Minimization Example A ...

Minimization Example A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.

Uses of standard deviation - measure of dispersion, Uses of Standard D...

Uses of Standard Deviation Normal 0 false false false EN-IN X-NONE X-NONE

What do you understand by the term operations research, Question : (a) ...

Question : (a) (i) What do you understand by the term "operations research"? (ii) Discuss three common operations research models. (b) Self-service at the university c

Construction of a mathematical model, The 2 nd phase of operations Resear...

The 2 nd phase of operations Research is to construct a mathematical model representing the system under study. It requires the identification of both static and dynam

Methodology of operation research, what is the methodology of operation res...

what is the methodology of operation research?

Method of calculation of mean deviation, Method of Calculation of Mean De...

Method of Calculation of Mean Deviation a. Computation of Mean Deviation Individual Series : The process of computing mean deviation in case of individual series involves

Linear programming solution by steps for two-phase method, Solve by Steps f...

Solve by Steps for Two-Phase Method Max Z = 5x 1 + 8x 2 Subject to 3x 1 + 2x 2 ≥ 3 x 1 + 4x 2 ≥ 4 x 1 + x 2 ≤ 5 & x 1 ≥ 0, x 2 ≥ 0 Answe

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

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

Centre of gravity., retail outlet x y volume A 6 9 ...

retail outlet x y volume A 6 9 80

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages