# Thread: Linear Programing problem

1. ## Linear Programing problem

I need to minimize a function that looks like that:

and constraints are:

My question is that is there a way I can write this problem using matrices and how can I apply simplex method for this problem, if not simplex is any other method more suitable?
I hope that I am not in wrong subforum and you can help me

2. ## Re: Linear Programing problem

The summations are not indexed in a meaningful way. $\displaystyle \sum_{k=1}^k a_k$ is meaningless because the upper bound is undefined. How does $k$ go from 1 to $k$? If $k$ is changing with each iteration, it either has no upper bound, or the upper bound is maybe 1?

3. ## Re: Linear Programing problem

Oh, you are right I am sorry, I know what you mean. This is a mistake!