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 1.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 grade Y respectively. Formulate this as a linear programming problem.

Related Discussions:- Linear Programming Problem

Applications of statistics in management, In a business, statis...

In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

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

Simulation models - operation research model, These models are used to dev...

These models are used to develop a method to evaluate the merit of alternative courses or action by representing with a mathematical model of the problems where various variab

Uses of mode - measure of central tendency, Uses of Mode The  use of t...

Uses of Mode The  use of the mode is recommended in the following  situations: a.When a quick  and approximate measures of  central tendency desired. b.When the  measure

Operation research, 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

Big M mehod, source code in c available?

source code in c available?

Modi Method, a manufacture wants to ship 8 loads of his product as shown be...

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.

Linear programming problem, #Solve the following Linear Programming Problem...

#Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Usage in the context of library and information services, Usage in the Cont...

Usage in the Context of Library and Information Services: In library and information science, there is, however, no need for making such distinction between data and informati

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

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