kibaekkim / dspopt.jl Goto Github PK
View Code? Open in Web Editor NEWJulia modeling interface to parallel decomposition solver DSP
License: MIT License
Julia modeling interface to parallel decomposition solver DSP
License: MIT License
Hello,
I am having an issue using different methods with DSPopt. I obtain the correct solution with the following code:
status = optimize!(model,
is_stochastic = false, # Needs to indicate that the model is NOT a stochastic program.
solve_type = DSPopt.ExtensiveForm, # see instances(DSPopt.Methods) for other methods
)
However, when I use solve_type = DSPopt.DW
, I do not obtain the correct optimal solution.
Any help would be greatly appreciated.
Binary variables do not have lower and upper bounds in MOI. Needs to explicitly pass to DSP the lower and upper bounds for binary variables.
This issue is used to trigger TagBot; feel free to unsubscribe.
If you haven't already, you should update your TagBot.yml
to include issue comment triggers.
Please see this post on Discourse for instructions and more details.
This function is available in DSP, but not implemented in this interface. The function can still be called by
DSPopt.@dsp_ccall("writeMps", Cvoid, (Ptr{Cvoid}, Ptr{UInt8}), DSPopt.dspenv.p, "myfile")
Hi,
I'm sorry for opening another issue, but I'm not able to understand why there is a segmentation fault when launching some examples. I tried to ran different examples always obtaining the following message (in this particular case I am running this example https://github.com/kibaekkim/DSPopt.jl/blob/0812121ea8031c3f67a8cf93a8f59ecdfe0ba897/examples/farmer_mpi_stoc.jl):
Am I doing something wrong?
Thank you for your help
Consider to have a feature to pass the ambiguity set information to DSP: https://github.com/Argonne-National-Laboratory/DSP/blob/master/examples/dro/DRDCAP.jl
Hi,
I'm trying to solve a large-scale model with DSP, and have tried the stochastic and non-stochastic formulations by following the farmer examples included. Also, I have successfully solved the problem with straight JuMP + Gurobi by modeling it manually in its explicit form, so I know it is feasible in all constraints. Nevertheless, when trying to solve it with DSPopt, ALPS always throws the "No primal ray is available" message, in stochastic and non-stochastic formulation, Dual or Extensive forms. Is it something which may be documented in the past? I could eventually share lps files of the model.
Kind regards!
Need to implement quadratic objective function
Hello,
Sorry for opening an issue during Christmas and New Year, but when I use DSPopt.jl, I failed to pass some of the tests and occurred the segmentation fault (received signal: 11).
I installed DSP and DSPopt in two places:
I also ran "ctest" for DSP and it didn't pass two tests on problems 6 and 24, I don't know whether it related to the failure of the DSPopt test.
Here "ctest" on DSP has no problem
I will be glab to provide more details if needed.
Any help would be appreciated.
The QCQP interface is available for stochastic programming only. We need to implement one of the following:
While we can run DSP in parallel, the scenario subproblems are not created in parallel.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.