linear programming , Operation Research

Assignment Help:
A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 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 200 and 500 per ton of grade Xand Y paper respectively. Formulate this as a Linear programming problem

Related Discussions:- linear programming

Analytical and decision- making skills, This assessment aims to provide stu...

This assessment aims to provide students with the opportunity to hone their analytical and decision- making skills. It also aims to help students develop their ability to think cre

Network models, These models are applied to the management ( planning con...

These models are applied to the management ( planning controlling and scheduling ) of large scale projects. PERT/ CPM techniques help in identifying potential trouble spots in

Sources of stress and job burnout, QUESTION Discuss the major sources o...

QUESTION Discuss the major sources of stress and job burnout and outline the strategies for managing stress. QUESTION How can you use the „Johari Window Model? as a

Evolution, how did operation research evolve

how did operation research evolve

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

Overhead projector -report writing presentation , Overhead Projector  ...

Overhead Projector  Overhead  projector  casts an images of the transparencies  on a  screen. Transparencies  are frequently  used  visual  aids  especially  when  audience

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X1+ X2 2 X1, X2 0on..

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

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