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. 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

Duality, maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

Chart the historical prices based on the monthly data, Choose a publicly tr...

Choose a publicly traded company (NYSE, AMX, or OTC) that interests you. If you don't know how to choose a company, think of IBM, DELL computer, Nike, Apple computer, GM, Ford, Nok

Anthology or book with articles or works by many authors , Anthology or Bo...

Anthology or Book with Articles  or Works by Many Authors   The name  of the person  compiling the book  will be  given  followed  by the  word editor. For more  than one  edit

Need of research proposal, Need Proposals are written for various reas...

Need Proposals are written for various reasons. They are prepared for different reasons which vary to the extent of details expected, but like research reports, the proposal a

LPP FORMULATION., 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

Experimental design and methodology , Case Study - Experimental Design ...

Case Study - Experimental Design Dental Clinic A leading dental clinic  with  three well qualified  dentists is seriously  considering  keeping  in touch  with  its  pat

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

Solved a.q, Solve the following Linear Programming Problem using Simple met...

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

information on research done, Information on Research Done Informatio...

Information on Research Done Information on Doctoral research work already done  is available from  the followings  sources: a. Bibliography of Doctoral  Dissertations Acce

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