linear programming , Mathematics

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

How will the decimal point move when 245.398 is multiplied, How will the de...

How will the decimal point move when 245.398 is multiplied by 100? It is moved two places to the right. While multiplying by multiples of 10, the decimal point is moved to the

Rules for inequalities, Here we look at only the rules without going ...

Here we look at only the rules without going into their proofs. They are: a  0. If a If a If a

Initial value problem, An IVP or Initial Value Problem is a differential eq...

An IVP or Initial Value Problem is a differential equation with an appropriate number of initial conditions. Illustration 3 : The subsequent is an IVP. 4x 2 y'' + 12y' +

Binormal vector - three dimensional space, Binormal Vector - Three Dimensio...

Binormal Vector - Three Dimensional Space Next, is the binormal vector.  The binormal vector is illustrated to be, B → (t) = T → (t) * N → (t) Since the binormal vecto

Find the coordinates of the point p, Find the coordinates of the point P wh...

Find the coordinates of the point P which is three -fourth of the way from A (3, 1) to B (-2, 5).

Define multiplication rule in probability, Q. Define Multiplication Rule in...

Q. Define Multiplication Rule in probability? Ans. A family has two girls, Ann and Barb, and three boys, Carl, David and Earl, in it. In how many ways can the mother pick

Fibonacci number, 1. Suppose n ≡ 7 (mod 8). Show that n ≠ x 2 + y 2 + z 2...

1. Suppose n ≡ 7 (mod 8). Show that n ≠ x 2 + y 2 + z 2 for any x, y, z ε Z. 2. Prove ∀n ε Z, that n is divisible by 9 if and only if the sum of its digits is divisible by 9.

TRIGONOMETRY, EXPLAIN ME ABOUT ITS FUNCTIONS.

EXPLAIN ME ABOUT ITS FUNCTIONS.

Functions of limits, Following is some more common functions that are "nice...

Following is some more common functions that are "nice enough". Polynomials are nice enough for all x's. If f ( x) = p ( x ) /q (x ) then f(x) will be nice enough provid

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