gekko | Market Share Visualization using D3 's Treemap & AngularJS
kandi X-RAY | gekko Summary
kandi X-RAY | gekko Summary
Gekko is a market share visualization app written using D3's Treemap, Highstocks, & AngularJS. It allows you to see the size of market sectors and how they change through time. The subsectors are clickable! When you click on one, a dialog with each related subsector and their prices will appear. Within this same dialog you can compare non-related sectors to each other.
Support
Quality
Security
License
Reuse
Top functions reviewed by kandi - BETA
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of gekko
gekko Key Features
gekko Examples and Code Snippets
Community Discussions
Trending Discussions on gekko
QUESTION
I face the following problem with GEKKO: some parameters (.Param) are changing (others not) when solving a model and I cannot determine why.
Background: I am currently trying to translate code from EViews (see gennaro.zezza.it) to python. I use GEKKO to simulate a system consisting out of 11 equations (for now). I do want to use parameters (instead of constants which seem to work perfectly fine) as I need to ('exogenously') change their value over time (and thus need an array).
Example: In the following example, an 'economic system' reacts to new government expenditures. Here, I particularly face problems with "m.alpha1" and "m.alpha2" - if they are introduced as ".Param" their value will change to 1.0 (instead of 0.6 and 0.4) when solving the model. How can I stop GEKKO from doing this? (Again, I want to be able to change, e.g., alpha1 to 0.7 after time x. E.g., lower and upper bounds won't help here.)
Thanks for your help!!
Code:
...ANSWER
Answered 2021-Jun-08 at 17:53The problem is that the name of the variable name='Propensity to consume out of income'
is over 25 characters long.
QUESTION
Let's say I have a pytorch-model describing the evolution of some multidimensional system based on its own state x and an external actuator u. So x_(t+1) = f(x_t, u_t) with f being the artificial neural network from pytorch.
Now i want to solve a dynamic optimization problem to find an optimal sequence of u-values to minimize an objective that depends on x. Something like this:
min sum over all timesteps phi(x_t)
s.t.: x_(t+1) = f(x_t, u_t)
Additionally I also have some upper and lower bounds on some of the variables in x.
Is there an easy way to do this using a dynamic optimization toolbox like pyomo or gekko?
I already wrote some code that transforms a feedforward neural network to a numpy-function which can then be passed as a constraint to pyomo. The problem with this approach is, that it requires significant reprogramming-effort every time the structure of the neural network changes, so quick testing becomes difficult. Also integration of recurrent neural networks gets difficult because hidden cell states would have to be added as additional variables to the optimization problem.
I think a good solution could be to do the function evaluations and gradient calculations in torch and somehow pass the results to the dynamic optimizer. I'm just not sure how to do this.
Thanks a lot for your help!
...ANSWER
Answered 2021-May-27 at 13:39Tensorflow or Pytorch models can't be directly integrated into the GEKKO at this moment. But, I believe you can retrieve the derivatives from Tensorflow and Pytorch, which allows you to pass them to the GEKKO.
There is a GEKKO Brain module and examples in the link below. You can also find an example that uses GEKKO Feedforward neural network for dynamic optimization.
GEKKO Brain Feedforward neural network examples
MIMO MPC example with GEKKO neural network model
Recurrent Neural Network library in the GEKKO Brain module is currently being developed, which allows using all the GEKKO's dynamic optimization functions easily.
In the meantime, you can use a sequential method by wrapping the TensorFlow or PyTorch models in the available optimization solver such as scipy optimization module.
Check out the below link for a dynamic optimization example with Keras LSTM model and scipy optimize.
QUESTION
I'm trying to solve a problem using Johnson's rule in GEKKO but unfortunately with no luck. It can easily be solved in excel, but I am trying to do it in python.
The problem:
there are two machines (Machine T and Machine K) that work one after the other. A product must go through machine T first and after that through Machine K. both machines can work simultaneously, but each machine cant work on more than 1 product at a time. the factory needs to minimize the time of production of all given products (i.e. minimize the idle time of machine k)
Products time for each machine:
...
ANSWER
Answered 2021-May-24 at 05:12Use binary variables with 25 total decisions (5x5 matrix) for x
. Each decision is whether to process that product on the specific tool. The equations are that each machine can only process one product at a time (sum(row)==1) and each product can only process once (sum(column)==1). The delay and slack variable (positive when there is no delay) are minimized. The delay is zero for the first time step because there is nothing processing on machine K. The delay is positive if the subsequent K time is more the T time.
QUESTION
I am trying to simulate 3D plane flight. I have an issue with gamma value (Flight-path angle). It gets out of its bounds and then, the simulation stops. The gamma value is being calculated by this equation:
I turned it into this: m.Equation(gamma.dt()==tf*((L*m.cos(Mu)-mass*g*m.cos(gamma))/mass*V))
The target of the simulation is for the plane to reach certain X an Y values(m.Minimize(w*final*(x-pathx)**2)
and m.Minimize(w*final*(pathy-y)**2)
), while minimizing fuel consumed m.Maximize(0.2*mass*tf*final)
.
The solver controls gamma
value, by controlling lift coefficient Cl
, which affects the lift value L
, which, in turn, affects gamma
value. The equation that calculates lift L
value looks like this: m.Equation(L==0.5*Ro*(V**2)*(Cl)*S)
. But in the end the solver can not control gamma
value till the plane gets to its destination.
What could be messing with it?
My code:
...ANSWER
Answered 2021-May-18 at 06:21I'm not sure exactly what the problem is. It looks like the optimizer is controlling gamma throughout the horizon, and it always stays within its bounds of -0.6 to 1.2. Can you provide more information about what is going wrong?
QUESTION
I am trying to optimize a summation function. From a similar question, I found half an answer for my problem(I have made my objective function similar to the one in that question).
Problem :
Attempt :
...ANSWER
Answered 2021-May-11 at 12:07As there aren't any responses, I'm sharing the workaround that I came up with. It probably is not an efficient way of doing it but it works.
QUESTION
I am trying to solve a MINLP problem using first the IPOPT solver to get an initial solution then the APOPT to get the mixed integer solution. However, I get the following error when calling the APOPT solver:
Error: Exception: Access Violation At line 359 of file ./f90/cqp.f90 Traceback: not available, compile with -ftrace=frame or -ftrace=full Error: 'results.json' not found. Check above for additional error details Traceback (most recent call last): File "optimisation_stack.py", line 244, in Optimise_G(t,ob, jofbuses, q, qc, s, oa, k, l, T, G_previous, C, Y, G_previous, G_max, G_min) File "optimisation_stack.py", line 134, in Optimise_G sol = MINLP(xinit, A, B, A_eq, B_eq, LB ,UB, t, ob, jofbuses, q, qc, s, oa, k, l, T, G_previous, C, Y, G_previous) File "optimisation_stack.py", line 215, in MINLP m_APOPT.solve(disp = False) File "C:\Users\Zineb\AppData\Local\Programs\Python\Python37\lib\site-packages\gekko\gekko.py", line 2227, in solve self.load_JSON() File "C:\Users\Zineb\AppData\Local\Programs\Python\Python37\lib\site-packages\gekko\gk_post_solve.py", line 13, in load_JSON f = open(os.path.join(self._path,'options.json')) FileNotFoundError: [Errno 2] No such file or directory: 'C:\Users\Zineb\AppData\Local\Temp\tmptdgafg1zgk_model1\options.json'
My code is the following, I tried to simplify it as much as possible :
...ANSWER
Answered 2021-May-08 at 13:24The Windows version of the APOPT solver crashed and wasn't able to find a solution. However, the online Linux version of APOPT is able to find a solution. Get the latest version of Gekko (v1.0.0 pre-release) available on GitHub. This will be available with pip install gekko --upgrade
when the new version is published but for now you need to copy the source to Lib\site-packages\gekko\gekko.py
. After updating gekko
, switch to remote=True
as shown below.
QUESTION
I want to maximise a concave function with two inputs
max 2 * x1 ** .8 + 1.4 * x2 ** .9
st x1 + x2 == C
using Gekko, but I get a error code -2.
...ANSWER
Answered 2021-May-07 at 17:28There is a successful solution by switching to the APOPT solver m.options.SOLVER = 1
. In this case the default solver, IPOPT, fails to find a solution but APOPT succeeds.
QUESTION
So I am simulating plane flight. The plane flies certain distance (pathx
and pathy
variables) and then the simulation stops, when certain pathx
and pathy
values are reached. The solver is trying to minimize the fuel consumption (m.Maximize(mass*tf*final)
, by maximizing the mass value. The solver controls the accelerator pedal position (Tcontr
).
Right now the termination condition is defined like this:
For X axis:
...ANSWER
Answered 2021-May-07 at 17:19Try adding a hard terminal constraint for both:
QUESTION
I cannot seem to figure out why IPOPT
cannot find a solution to this. Initially, I thought the problem was totally infeasible but when I reduce the value of col_total to any number below 161000 or comment out the last constraint equation that contains col_total, it solves and EXITs with an Optimal Solution Found and a final objective value function of -161775.256826753
. I have solved the same Maximization problem using Artificial Bee Colony
and Particle Swamp Optimization
techniques, and they solve and return optimal objective value function at least 225000 and 226000 respectively. Could it be that another solver is required? I have also tried APOPT
, BPOPT
, and IPOPT
and have tinkered around with the tolerance values, but no combination none seems to work just yet. The code is posted below. Any guidance will be hugely appreciated.
ANSWER
Answered 2021-Apr-21 at 17:01Built the equations without .value
in the expressions. The x[i].value
is only needed at the end to view the solution after the solution is complete or to initialize the value of x[i]
. The expression m.Maximize(y)
is more readable than m.Obj(-y)
although they are equivalent.
QUESTION
I am trying to do a dynamic simulation of ammonia reactor using GEKKO. Unfortunately, my code error says that it can't reach a solution. The equations I am trying to solve are steady-state in terms of species continuity equations but dynamic in terms of heat balance. I used the code shown below to first solve for the steady-state condition, which it does successfully by setting the IMODE = 1. However, when I import the steady-state results and used it to initialise my dynamic-state code, no solution is achieved. I do not understand how my code is not working when solving for the dynamic model since it worked fine for the steady-state model. I have tried IMODE = 4 and 7 but neither of them worked. Does anyone have any idea why my code is not working for the dynamic simulation?
...ANSWER
Answered 2021-May-04 at 22:07GEKKO_single
is missing so the script is missing the configuration parameters. Here are some tips in absence of any verification:
- Set a smaller time horizon to see if it will complete a solution:
Community Discussions, Code Snippets contain sources that include Stack Exchange Network
Vulnerabilities
Install gekko
Support
Reuse Trending Solutions
Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items
Find more librariesStay Updated
Subscribe to our newsletter for trending solutions and developer bootcamps
Share this Page