I have a mixed-integer linear programming problem which I solved in Gekko with the solver APOPT. I want to try other solvers to see if they can solve my problem faster (e.g. linprog or GLPK ).
Is there a possibility to use them in GEKKO?
Is there a possibility to call an external solver with GEKKO?
142 views Asked by tt40kiwi At
1
There are 1 answers
Related Questions in PYTHON
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
Related Questions in GEKKO
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Popular Tags
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
You can't use an external solver with Gekko but you can request a solver interface by creating a new feature request on GitHub. The only solvers currently supported are APOPT, BPOPT, IPOPT, and some commercial solvers. Other solvers such as scipy.optimize.linprog and GLPK are limited to linear or mixed integer linear programming problems.
The GLPK (GNU Linear Programming Kit) package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.
Linear programming: minimize a linear objective function subject to linear equality and inequality constraints.
Solvers such as APOPT can solve linear programming and mixed integer linear programming problems but also nonlinear mixed integer programming problems. Here is more information on a linprog equivalent in Gekko with sparse or dense matrices.