solver

问题 Suppose I am trying to solve a system of differential equations using an ode solver in MATLAB. Suppose also that I have defined an events functions to locate three different events which are all terminal. I have noticed that on some occasions the ie quantity that is returned upon the location of one of the events ( ie is the index of the event that stopped the solver, in my case it could be 1, 2 or 3) is not always a single number but a vector with two elements (usually these elements are

问题 I have an optimization problem set up in Excel. When I optimize (using the gui), I get the final (optimum) value of the objective function. I can see that excel calculates the objective function values for a lot of points and settles on the optimum one. Is there a way to save all the objective function values to some range in the excel sheet. It would be great if I can do it using the solver GUI. If not, a VBA based solution would do too. Thanks. 回答1: This is possible to do, but is manually

问题 I'm a newbie with Excel solver and only just learned about it after picking up a data science book. I'd like to get more familiar with this tool, so I've been trying my hand at solving different problems. I'm stuck on one though, and I'm not even sure if it's possible to use solver for? Basically, the constraint I need to check for is whether two cells are adjacent. My problem: I have a bunch of bags containing different numbers of marbles. I want to maximize the number of marbles I get by

问题 Hi I have the following code which runs a single optimisation through solver which I would like to run in a loop. the single run code is: Sub Macro4 SolverReset SolverOk SetCell:="$D$36", MaxMinVal:=2, ValueOf:="0", ByChange:="$D$7:$R$7" SolverAdd CellRef:="$S$7", Relation:=2, FormulaText:="1" SolverAdd CellRef:="$D$7:$R$7", Relation:=1, FormulaText:="$D$6:$R$6" SolverAdd CellRef:="$D$7:$R$7", Relation:=3, FormulaText:="$D$5:$R$5" SolverAdd CellRef:="$D$37", Relation:=2, FormulaText:="$D$41"

问题 I want to use Solver to find a target sum from a subset of a larger set. (10 number subset of 16 numbers). I'm not very familiar with Solver and I'm unsure of the best way to set my constraints. I have 5 categories of numbers within the set, A, B, C, D, E. The set of 16 may include different combinations of these categories, but the target subset total has a defined makeup: A, B, B, C, C, C, (B or C), (B or C),D, E So my question is, how would I introduce these rules into Solver? Secondarily,

问题 I want to use Solver to find a target sum from a subset of a larger set. (10 number subset of 16 numbers). I'm not very familiar with Solver and I'm unsure of the best way to set my constraints. I have 5 categories of numbers within the set, A, B, C, D, E. The set of 16 may include different combinations of these categories, but the target subset total has a defined makeup: A, B, B, C, C, C, (B or C), (B or C),D, E So my question is, how would I introduce these rules into Solver? Secondarily,

问题 Every goal that I have encountered in Isabelle so far that could be solved using arith could also be solved by presburger and vice versa, for example lemma "odd (n::nat) ⟹ Suc (2 * (n div 2)) = n" by presburger (* or arith *) What's the difference between the two solvers? Examples of goals that one can solve but the other can't would be nice. Edit: I managed to come up with a lemma proved by arith that presburger can't handle. It seems like this has something to do with real numbers: lemma

问题 I am using the built-in solver in Excel 2007 within a VBA loop to solve a number of different problems. Occasionally, the solver hits the maximum time, which causes a pop-up dialog box to appear asking whether the user wants to Continue, Stop, or End. In all cases I want it to end, and proceed to the next line of the loop. This will prevent a user from having to sit there and respond each time. I ran a macro with the solver pass thru method (Catch max time/iteration dialog box when using

问题 Hi i came across this puzzle which is a subset of famous kind of word and numbers based puzzles called Cryptarithms. Say you have an expression as S E N D + M O R E = M O N E Y Now the interesting part there is that, each alphabet is representing a unique digit from 0-9. I wanted to write a generalized solver, but i ended up writing a brute forced solution for it. Any takers as how can i solve it? I think it can be solved using predicate logic or set theory. And i'm particularly interested in

问题 As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. Closed 8 years ago . I'm looking for a good easy to use Java based Quadratic Programming (QP) solver. Googling around I came across ojAlgo (http://ojalgo