Linear Programming , 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. 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. Formulae this as a Linear programming problem

Related Discussions:- Linear Programming

North west corner rule, North West Corner Rule for Initial Solution: Now ...

North West Corner Rule for Initial Solution: Now by applying North West corner rule we can initial solution. According to this rule without regard to cost consideration the

Integer programming, An integer programming problem is identical to a linea...

An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot

Machine tabulation, Machine  Tabulation This methods  of tabulating i...

Machine  Tabulation This methods  of tabulating information  is generally used in  case of extensive  large scale  surveys. Mechanical sorting and tabulating equipments and su

Game thoery, In a rectangular game, pay-off matrix of player A is as follow...

In a rectangular game, pay-off matrix of player A is as follows: i) Solve the game. ii) Write down the pay-off matrix of B and then, solve the game.

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

Operations function - information system, The Operations Function has alway...

The Operations Function has always relied heavily on information for its smooth running. During this course information has been introduced as one of the five inputs to the convers

Linear programming problem, Solve the following Linear Programming Problem ...

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

Degree of correlation ship - correlation regression analysi, Degree of  Co...

Degree of  Correlation ship 1. Perfect Correlation: When  changes  in  two related variables are  exactly  proportional  there is  perfect correlation between  them. In case

Panel sampling - sampling decisions, Panel Sampling Here the initial  s...

Panel Sampling Here the initial  samples are down  on random  basis  and information  from  these is collected  on regular  basis. Itis  semi permanent sample where members may

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Write Your Message!

Captcha
Free Assignment Quote

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd