Following are the characteristics of my problem:
Objective function: two non-linear functions and one linear function
Decision variable: two integer variables - can be relaxed as real (thus, problem can be INLP or NLP)
Constraint: three (two bounding constraint and one relationship constraint)
Problem type: non-convex
Solution required: Global optimum
Is there any python solvers to solve the above multi-objective optimization problem using Successive Quadratic Programming (SQP) or Interior Point Methods or other appropriate NLP solution methods?
Here is a simple example of an MINLP solved with Python Gekko and the APOPT solver:
Here is another example with equality and inequality constraints and integer variables (Hock Schittkowski #71 benchmark but with integer variables).
There is additional information in the Gekko documentation and on this page about MINLP Optimization. The only requirement that it doesn't satisfy is to find a global optimum. A multi-start method or a dedicated solver such as BONMIN or BARON are options.