Saturday, January 28, 2012

Optimal algorithm: Linear Programming

This week, i have learn about Linear Programming and using simplex algorithm
Linear programming (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships. Linear programming is a specific case of mathematical programming (mathematical optimization).
[wikipedia]

Then I could give you some example, this is the popular problem called Diet Problem. The decision about how much of each food to buy (or eat) is to made entirely on dietary and economic considerations. And they will provide us the table of cost or nutrition stuff in order to support the question. Somehow if you ask me, i'll select my favorite first and eat them all. (LOL)

Last Thursday, I had chance to had a lunch with our lecturer and we were talking about some funny stuff in term of Duality. We discuss about how we should eat, should we eat the favorite food first or keep it for the last. My friend said, 'I'll save the best for the last'. I think this problem object to the maximum value, you eat them all but keep the best for the last. Then mine was different, I'll eat my favorite food first in order not to full at the last. So it might be object to minimum value. Subject to the quantity and quality of food. If save the best for the last is Primal, then eat the best first should be Dual for sure!

PS. don't believe my word this time, we just made fun because our optimization method teacher was with us that time. (LOL)

No comments: