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

Linear programming, Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subj...

Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subject to 3_(x_1 )+?1.5?_(x_2 )=30 x_1+x_2=20 x_1=0 x_2=0

Sequencing, how the sequencing techniques help the manager

how the sequencing techniques help the manager

Optimization, Find a minimum cost spanning arborescence rooted,

Find a minimum cost spanning arborescence rooted,

MODI method, explain the procedure of MODI method of finding solution throu...

explain the procedure of MODI method of finding solution through optimaly test.

test statistic - hypothesis testing , Test Statistic The next step ...

Test Statistic The next step is compute an appropriate test statistic which is based on an appropriate probability distribution. It is used to test whether the null hypo

Oral presentation - report writing presentation, Oral Presentation At ...

Oral Presentation At times oral presentation of the results of the study is considered effective particularly in case where policy recommendations are indicated by project

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

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

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

One tailed and two tailed tests -hypothesis testing , Normal 0 ...

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

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