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

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

Video tapes - report writing presentation , Video  Tapes  Video  t...

Video  Tapes  Video  tapes  are very  information  and attention  grabbing  presentational  supports. They  are  best  for illustrating the  persons  in actions  and presen

#title scope.., scope of the operation research in modern management?

scope of the operation research in modern management?

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Theoretical framework, Ask questiAvatars are virtual characters that can be...

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

Sequensing problem, job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10...

job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10 6 12 1 3

Sequencing models, The sequencing problems arises whenever there is probl...

The sequencing problems arises whenever there is problems in determining the sequence ( order) in which a member of tasks can be performed by a number of service facilities su

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 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