New to optimization, trying to understand the characteristics of a problem I am in the process of modelling, and looking to solve in Python. Given is a decision variable k,the sum of N other decision variables c, and two constants, a and T. Both a and T are positive numbers.
I want to maximize k subject to (a + c) * k <= T.
What kind of problem is this? I can see that the chosen values for c maximizes k. In addition, they are multiplied together in a constraint, which followingly does not look linear, i.e. this is not a Linear Program.
At the time of writing, I am only familiar with Google OR-Tools as a means to solve optimization problems, and if this problem is either non-linear or quadratic, I might need something else to solve it.
Any clues on what I am looking for here?