linear programming problem, Operation Research

Assignment Help:
A paper mill produces two grades of paper viz., X and Y. Because of raw
each)
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

Microforms and photographs - classification of documents, Photographs and I...

Photographs and Illustrations: Photographs and illustrations are documents which provide a visual or pictorial representation of a person, place or situation which words fail

Operations research approach to problem solving, Formulation of the Problem...

Formulation of the Problem: Before proceeding to find the solution of a problem, first of all a manager should be competent enough to form an appropriate model. To do so f

Methods of survey and study, Methods of Survey and Study:   Some method...

Methods of Survey and Study:   Some methods of collecting information about the organisation and about the information requirement of potential users are mentioned below. No si

Vogel approximation methods, This method is more  systematic and orderly th...

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

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

Classification of documents by information characteristics , Classification...

Classification of documents by information Characteristics: The schemes of classification advocated by Hanson and Grogan are mainly based on the information characteristics of

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Case Analysis, Ask question #Minimum 100 woRead this article and then write...

Ask question #Minimum 100 woRead this article and then write a three-page summary of the application (problem definition, objective function constraints, decision variables, etc.)

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