Linear Programming : Simplex Method

See more:

C#

Java

Respected members,

I need to solve a problem using Linear programming : simplex method or any algorithm (without using any sort of Libraries) which comes in category of linear code that is :

An Example: The Diet Problem
• A student is trying to decide on lowest cost diet that
provides sufficient amount of protein, with two choices:
– steak: 2 units of protein/pound, $3/pound
– peanut butter: 1 unit of protein/pound, $2/pound
• In proper diet, need 4 units protein/day.
Let x = # pounds peanut butter/day in the diet.
Let y = # pounds steak/day in the diet.
Goal: minimize 2x + 3y (total cost)
subject to constraints:
x + 2y ³ 4
x ³ 0, y ³ 0

This is an optimization problem.
• Any solution meeting the nutritional demands is called
a feasible solution
• A feasible solution of minimum cost is called the
optimal solution.

I'm stuck that how do I implement it on C# or Java language .. How do i start quite confused any help will be appreciated.

Thanks