Answer, Operation Research

Assignment Help:
A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- Answer

Duality, For every LP formulation there exists another unique linear ...

For every LP formulation there exists another unique linear programming formulation called the 'Dual' (the original formulation is called the 'Primal'). Same data

Method of concurrent deviations, Method of Concurrent Deviations The  ...

Method of Concurrent Deviations The  coefficient  of concurrent  deviation or coefficient  of correlation  b the concurrent deviation  methods  is given  by the formula. R

Assignment, Q2. Six Operators are to be assigned to five jobs with the cost...

Q2. Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assign

PERT, how does it work

how does it work

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.

Production and operations management., layout of any retailer shop and the ...

layout of any retailer shop and the reasons for the layout

Rank methods spearman s, Rank Methods Spearman s When the variables  u...

Rank Methods Spearman s When the variables  under  consideration are  not capable  of quantitative  measurement but can  be arranged  in serial  order( ranks) we find  correla

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

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