[sage-support] Re: incorrect limit

On 2016-04-17, kcrisman wrote: > Thanks. In pure Maxima we get: > > (%i3) limit((x^(1/x)-1)*sqrt(x),x,inf); > (%o3) inf > (%i4) limit((x^(1/x)-1)*sqrt(x),x,0); > (%o4) und > (%i5)

[sage-support] Re: Default output form for AlgebraicNumber

On Tuesday, April 19, 2016 at 4:12:31 AM UTC-7, jori.ma...@uta.fi wrote: > > Matrix(QQ, [[1,2],[3,4]]).eigenvalues() --> [-0.3722813232690144?, > 5.372281323269015?] > Not good for teaching (and I just got a complain for that). Of course I > can do map(lambda x: x.radical_expression(),

[sage-support] Re: How to get all solutions of a MILP?

here is an example: sage: P=3*polytopes.cube() sage: (p,x)=P.to_linear_program(solver='ppl',return_variable=True) sage: p.set_objective(x[0]) # maximizing x[0] over 3 times inflated unit cube sage: p.solve() 3 sage: p.add_constraint(x[0]==3) # restrict to the optimal face sage: Q=p.polyhedron()

[sage-support] Re: Default output form for AlgebraicNumber

On Tuesday, April 19, 2016 at 12:12:31 PM UTC+1, jori.ma...@uta.fi wrote: > > Matrix(QQ, [[1,2],[3,4]]).eigenvalues() --> [-0.3722813232690144?, > 5.372281323269015?] > > Not good for teaching (and I just got a complain for that). Of course I > can do map(lambda x: x.radical_expression(),

[sage-support] Default output form for AlgebraicNumber

Matrix(QQ, [[1,2],[3,4]]).eigenvalues() --> [-0.3722813232690144?, 5.372281323269015?] Not good for teaching (and I just got a complain for that). Of course I can do map(lambda x: x.radical_expression(), M.eigenvalues()) or something similar. Or begin with Matrix(SR, ...). But is there a

[sage-support] Re: How to get all solutions of a MILP?

On Tuesday, April 19, 2016 at 11:26:23 AM UTC+1, Jeroen Demeyer wrote: > > Hello, > > I have a MixedIntegerLinearProgram where all variables are integers. I > want to minimize one of the variables, but I need *all* solutions, i.e. > all assignments to the variables which minimize the goal

[sage-support] How to get all solutions of a MILP?

Hello, I have a MixedIntegerLinearProgram where all variables are integers. I want to minimize one of the variables, but I need *all* solutions, i.e. all assignments to the variables which minimize the goal function (I know that this list is finite). Is there a simple way to do this?