# What Optimization Algorithm/Technique Should I Use to Solve This Problem?

I am facing an optimization problem stated below:

Find the values of $x_i$ where $i = 1, ..., 20$ and $0 \leq x_i \leq 1$,

to maximize $y$:

$$y = \sum_{i = 1}^{20}\theta(1 - \theta)^{20 - i}(\alpha x_i + \beta(1 - x_i))$$

where $\theta \in (0, 1)$ and $\alpha, \beta \in R$

while making sure that

$$\sum_{i = 1}^{t}(1 - x_i) \leq a(\sum_{i = 1}^tx_i - b)_+$$

for any $t \in [1, 20]$, where $a, b \in R$

Could you advice what optimization algorithm/technique should I look into in order to solve this problem? I don't need a complete solution.

• Have to tried goal seek / solver in Excel? – unseen_rider Sep 8 '17 at 15:20
• What does $(\cdot)_+$ mean? – Rodrigo de Azevedo Sep 8 '17 at 18:00
• @RodrigodeAzevedo I think $(x)_+$ means $max(x, 0)$. Related post – hklel Sep 8 '17 at 18:45

It's a completely standard linear program in the form $\max c^T x$ subject to $Ax \leq b$.
EDIT: I did not see the $()_{+}$ operator. With that, it is not a linear program but a nonconvex problem which at least requires mixed-integer linear programming.