0

I have a nonlinear optimization problem of the form :

$$ \begin{align} & \underset{ \mathbf{x} }{ \text{ maximize } } & & f(\mathbf{x}) \\ & \text{ subject to } & & g(\mathbf{x}) \leqslant 0,\\ & & & x_{ i } \in \{ 0,\cdots,r \}. \forall i \end{align} $$

where $g(\mathbf{x})$ is a nonlinear function. I did the transfomation $x_i=\log y_i$ and make the problem a linear programming problem as:

$$ \begin{align} & \underset{ \mathbf{y} }{ \text{ maximize } } & & f(\mathbf{y}) \\ & \text{ subject to } & & g(\mathbf{y}) \leqslant 0,\\ & & & y_{ i } \in \{ 1,,\cdots,e^r \}. \forall i \end{align} $$

How to model this problem in a solver ? Specifically, how to write the constraint $y_{ i } \in \{ 1,,\cdots,e^r \}$ in a solver ?

drzbir
  • 496
  • 4
  • 19
  • 1
    It looks like your constraint $y_i \in {e^0, e^1, ..., e^r}$ restricts your variables to a discrete set. So, it is not a linear programming problem (it is still non-convex, at best an integer linear program, provided the $f$ and $g$ functions are linear in the variables). If the functions are indeed linear, it may be useful to relax the problem to a linear program via the relaxed interval constraints $y_i \in [1, e^r]$ for all $i$. – Michael Nov 06 '15 at 23:27
  • But can we guarantee that the relaxed problem still gives the optimal solution? – drzbir Nov 06 '15 at 23:39
  • The relaxed problem may not give an optimal solution. It will give an upper bound. – Michael Nov 07 '15 at 05:10
  • Thank you. So there is no way to solve the problem optimally? Are there any solvers available? – drzbir Nov 07 '15 at 23:56
  • One way to solve optimally is to try all of the (finite) number of possible solution options. There is no polynomial time way of solving. There are general integer linear program solvers available that may help and may be a bit more efficient than trying all possibilities. Note: I do not see where your title of "countable subset of $\mathbb{R}$" comes into this problem. Perhaps you meant "finite subset of $\mathbb{R}$." – Michael Nov 08 '15 at 21:55

0 Answers0