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

Assignment, Q2.Six Operators are to be assigned to five jobs with the cost ...

Q2.Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignm

Quantitative Technique for business, Davidson construction company is build...

Davidson construction company is building a luxury lakefront home in batangas coordination of the architech an sub contractors will require a major effort to meet the 44-week (appr

Line balancing methods - heuristic approach, Line Balancing Methods - Heuri...

Line Balancing Methods - Heuristic Approach Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so

Line balancing, what happen if line balancing does not exist

what happen if line balancing does not exist

Operations research as a decision-making sci, Short Define operations resea...

Short Define operations research as a decision-making science

Sources of hypothesis - hypothesis testing, Sources of Hypothesis Hyp...

Sources of Hypothesis Hypothesis may be developed from various sources. Some of the important sources are the followings: 1. A Hypothesis Arises from Intuition

Cgj, application&techniques

application&techniques

Modi method, find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 3...

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 0

Mathematical Model, What is meant by a mathematical model of a real situati...

What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems

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