-
September 7th, 2012, 08:55 PM
#1
Algorithm - Minimizing Equation - Dynamic Programming/Greedy
Hi,
If we are given an equation say 3x + 2y <= 10, we want to find the value of x and y such that
x + y = maximum and 10 - 3x - 2y is minimized. How can this be done? I am thinking of it as a dynamic programming problem ! but not sure if I am right.
In the above x = 0 and y = 5 will be the answer.
Thanks.
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|