Gekko (optimization software)
≈ 7 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The GEKKO Python package solves large-scale mixed-integer and differential algebraic equations with nonlinear programming solvers (IPOPT, APOPT, BPOPT, SNOPT, MINOS). Modes of operation include machine learning, data reconciliation, real-time optimization, dynamic simulation, and nonlinear model predictive control. In addition, the package solves Linear programming (LP), Quadratic programming (QP), Quadratically constrained quadratic program (QCQP), Nonlinear programming (NLP), Mixed integer programming (MIP), and Mixed integer linear programming (MILP).
GEKKO is available in Python and installed with pip from PyPI of the Python Software Foundation. pip install gekko GEKKO works on all platforms and with Python 2.7 and 3+. By default, the problem is sent to a public server where the solution is computed and returned to Python. There are Windows, MacOS, Linux, and ARM (Raspberry Pi) processor options to solve without an Internet connection. GEKKO is an extension of the APMonitor Optimization Suite but has integrated the modeling and solution visualization directly within Python.
A mathematical model is expressed in terms of variables and equations such as the Hock & Schittkowski Benchmark Problem #71 used to test the performance of nonlinear programming solvers.…
The GEKKO Python package solves large-scale mixed-integer and differential algebraic equations with nonlinear programming solvers (IPOPT, APOPT, BPOPT, SNOPT, MINOS). Modes of operation include machine learning, data reconciliation, real-time optimization, dynamic simulation, and nonlinear model predictive control. In addition, the package solves Linear programming (LP), Quadratic programming (QP), Quadratically constrained quadratic program (QCQP), Nonlinear programming (NLP), Mixed integer programming (MIP), and Mixed integer linear programming (MILP).
GEKKO is available in Python and installed with pip from PyPI of the Python Software Foundation. pip install gekko GEKKO works on all platforms and with Python 2.7 and 3+. By default, the problem is sent to a public server where the solution is computed and returned to Python. There are Windows, MacOS, Linux, and ARM (Raspberry Pi) processor options to solve without an Internet connection. GEKKO is an extension of the APMonitor Optimization Suite but has integrated the modeling and solution visualization directly within Python.
A mathematical model is expressed in terms of variables and equations such as the Hock & Schittkowski Benchmark Problem #71 used to test the performance of nonlinear programming solvers. This particular optimization problem has an objective function \min_{x\in\mathbb R}\; x_1 x_4 (x_1+x_2+x_3)+x_3 and subject to the inequality constraint x_1 x_2 x_3 x_4 \ge 25 and equality constraint {x_1}^2 + {x_2}^2 + {x_3}^2 + {x_4}^2=40 . The four variables must be between a lower bound of 1 and an upper bound of 5.
The initial guess values are x_1 = 1, x_2=5, x_3=5, x_4=1 .
This optimization problem is solved with GEKKO as shown below. from gekko import GEKKO m = GEKKO() # Initialize gekko Initialize variables x1 = m.Var(value=1, lb=1, ub=5) x2 = m.Var(value=5, lb=1, ub=5) x3 = m.Var(value=5, lb=1, ub=5) x4 = m.Var(value=1, lb=1, ub=5) Equations m.Equation(x1 * x2 * x3 * x4 >= 25) m.Equation(x1 ** 2 + x2 ** 2 + x3 ** 2 + x4 ** 2 == 40) m.Minimize(x1 * x4 * (x1 + x2 + x3) + x3) m.solve(disp=False) # Solve print("x1: " + str(x1.value)) print("x2: " + str(x2.value)) print("x3: " + str(x3.value)) print("x4: " + str(x4.value)) print("Objective: " + str(m.options.objfcnval))
Applications of GEKKO
Applications include cogeneration (power and heat), drilling automation, severe slugging control, solar thermal energy production, solid oxide fuel cells, flow assurance, Enhanced oil recovery, Essential oil extraction, and Unmanned Aerial Vehicles (UAVs). There are many other references to APMonitor and GEKKO as a sample of the types of applications that can be solved. GEKKO is developed from the National Science Foundation (NSF) research grant #1547110 and is detailed in a Special Issue collection on combined scheduling and control.
Other notable mentions of GEKKO are the listing in the Decision Tree for Optimization Software, added support for APOPT and BPOPT solvers, projects reports of the online Dynamic Optimization course from international participants. GEKKO is a topic in online forums where users are solving optimization and optimal control problems.
GEKKO is used for advanced control in the Temperature Control Lab (TCLab) for process control education at 20 universities. from gekko import brain import numpy as np b = brain.Brain() b.input_layer(1) b.layer(linear=3) b.layer(tanh=3) b.layer(linear=3) b.output_layer(1) x = np.linspace(-np.pi, 3 * np.pi, 20) y = 1 - np.cos(x) b.learn(x, y) The neural network model is tested across the range of training data as well as for extrapolation to demonstrate poor predictions outside of the training data.
Predictions outside the training data set are improved with hybrid machine learning that uses fundamental principles (if available) to impose a structure that is valid over a wider range of conditions. In the example above, the hyperbolic tangent activation function (hidden layer 2) could be replaced with a sine or cosine function to improve extrapolation.
The final part of the script displays the neural network model, the original function, and the sampled data points used for fitting. import matplotlib.pyplot as plt xp = np.linspace(-2 * np.pi, 4 * np.pi, 100) yp = b.think(xp) plt.figure() plt.plot(x, y, "bo") plt.plot(xp, yp[0], "r-") plt.show() Optimal control is the use of mathematical optimization to obtain a policy that is constrained by differential \left(\frac{d\,x_1}{d\,t}=u\right) , equality \left(x_1(0) = 1\right) , or inequality \left(-1 \le u(t) \le 1\right) equations and minimizes an objective/reward function \left(\min_u \frac{1}{2} \int_0^2 x_1^2(t) \, dt\right) .
The basic optimal control is solved with GEKKO by integrating the objective and transcribing the differential equation into algebraic form with orthogonal collocation on finite elements. from gekko import GEKKO import numpy as np import matplotlib.pyplot as plt m = GEKKO() # initialize gekko nt = 101 m.time = np.linspace(0, 2, nt) Variables x1 = m.Var(value=1) x2 = m.Var(value=0) u = m.Var(value=0, lb=-1, ub=1) p = np.zeros(nt) # mark final time point p[-1] = 1.0 final = m.Param(value=p) Equations m.Equation(x1.dt()
u) m.Equation(x2.dt()
0.5 * x1 ** 2) m.Minimize(x2 * final) m.options.IMODE = 6 # optimal control mode m.solve() # solve plt.figure(1) # plot results plt.plot(m.time, x1.value, "k-", label=r"$x_1$") plt.plot(m.time, x2.value, "b-", label=r"$x_2$") plt.plot(m.time, u.value, "r--", label=r"$u$") plt.legend(loc="best") plt.xlabel("Time") plt.ylabel("Value") plt.show()
References
GEKKO is open-source product of National Science Foundation (NSF) research grant 1547110 References to APMonitor and GEKKO in the literature 18 examples of GEKKO: machine learning, optimal control, data regression Gekko Download Statistics
Text derived from https://en.wikipedia.org/w/index.php?oldid=1347680447 under CC BY-SA 4.0; modifications have been made.