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

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

LINEAR PROGRAMMING, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Game theory, rectangular game

rectangular game

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

Objective of operation research, what are the objectives of operation resea...

what are the objectives of operation research?

Production and operations management., layout of any retailer shop and the ...

layout of any retailer shop and the reasons for the layout

QUANTITATIVE ANALYSIS, Ask queA manufacturing firm has discontinued product...

Ask queA manufacturing firm has discontinued production of a certain unprofitable product line. This created considerable excess production capacity. Management is considering to d

Significance and scpope of o.r, significance and scope of operation resarch...

significance and scope of operation resarch in morden management?

Operations strategy in an organization, 1. Investigate: The Operations Str...

1. Investigate: The Operations Strategy of your organisation or one you are familiar with and answer the following points. Does your chosen organisation have an operations

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded. 1. Minimize z = 3x + 5y subject to constraints X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

User Account

All Pages