System of linear inequalities - mixture We have 4 types bottles of water. Bottle 1 - with capacity

Jasmin Pineda 2022-06-27 Answered
System of linear inequalities - mixture
We have 4 types bottles of water. Bottle 1 - with capacity 750ml - we have 2 for use with price 0,25 Bottle 2 - with capacity 500ml - we have 3 for use with price 0,5 Bottle 3 - with capacity 250ml - we have 5 for use with price 0,75 Bottle 4 - with capacity 100ml - we have 10 for use with price 1
Using water from these 4 types of bottles we have to create "aqueous mixture" containing 3050ml of water in total.
How we should pour water from those bottles that cost as low as possible and to have the least possible loss of water.
How to solve this?
You can still ask an expert for help

Want to know more about Inequalities systems and graphs?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

Korotnokby
Answered 2022-06-28 Author has 19 answers
This seems like the knapsack problem - Note that while the native solution is exponential, programming the solution with some intelligence (that is, by using "dynamic programming" - i.e, solving it bottom up while using memoization) will give you a polynomial-time algorithm

We have step-by-step solutions for your answer!

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-05-19
Computing bounding box of polytope (system of linear inequalities)
Given a N real valued variables and a set of linear inequality constraints, I would like to find a minimal bounding box which encapsulates the convex polytope defined by these constraints.
asked 2022-05-30
Solving System on Inequalities Numerically
I am stuck on a problem that says given for the range [750,1800] (where each element has a spacing of 5 units: [750,755,760,...,1795,1800]), to select 4 elements from this range who are all at least 150 units apart from each other.
asked 2022-06-29
How can I prove that for any real ( x , y ) root this system of equations
x 4 + y 2 = ( a + 1 a ) 3
x 4 y 2 = ( a 1 a ) 3
the inequation x 2 + | y | 4 is always true?
Also, when will x 2 + | y | = 4 be true for this system?
asked 2022-06-13
Let f : R R be a continuous function and g : R R be a Lipschitz function. Would you help me to prove that the system of differential equation
x = g ( x )
y = f ( x ) y
with initial value x ( t 0 ) = x 0 and y ( t 0 ) = y 0 has a unique solution.
Could I prove the uniqueness solution of x = g ( x ), x ( t 0 ) = x 0 by Gronwall Inequality first then use the result to prove the second?
asked 2022-06-25
Find the values of   a , b   so that the polyhedral set defined by the system of inequalities
a x + ( b + 1 ) y 120 x + ( a + b ) y 160 ( a b ) x + y 30 x 0 y 0
has extreme direction.
asked 2022-06-14
Power series and ratio test: confused about the interval of convergence
I have a question for you. I was asked to find the Maclaurin series of ln ( sin x / x ) and to evaluate its convergence. After finding the power series, I've applied the ratio test and I've found that the series converges for | x 2 / 6 + x 4 / 120 | < 1. When I solve the system of inequalities, I find that it is actually impossible, because the first inequality is verified for every real value of x, while the second one has no solution. How can it be? Where do I go wrong?
asked 2022-06-16
Counting integer solutions for a system of inequalities
I wish to enumerate the number of solutions of the system of equations and inequalities for 3 non-negative integer unknowns x , y , z 0: ( a, b specified)
x + y + z = a x + y > b y + z > b
Is there an elegant way of finding the number of solutions or must I use an exhaustive numerical algorithm?