260 Reputation

10 years, 221 days

Social Networks and Content at Maplesoft.com

PH.D in Applied Mathematics

solution to question...

g(x,t):=2*x+t:#(can be any other function)
f(t):=int(g(x,t),x=a..b);

Error Of Code...

Hi there

I think your code has some errors

First of all, you want to minimize "obj"  under "cnsts" contraints while it is not a constraint. this is like to: "minimize A+B"
Under "C+D", so C+D equals to what? 0?1?2? or....?

please see the following to better understand

>restart;
> with(Optimization);
> with(plots);
> obj := (c0-x)^2+(c1-(2/3)*x-(1/3)*y)^2+(c2-(1/3)*x-(2/3)*y)^2+(c3-y)^2;
> cnsts := 32*x+19*y - 15*c0+18*c1+15*c2+3*c3;
>           Minimize(obj, {cnsts=2});

-16
[0.122523514868939 10   , [c0 = 0.0324728625338177,

c1 = 0.0295075458457925, c2 = 0.0265422291577672,

c3 = 0.0235769124697419, x = 0.0324728625338178,

y = 0.0235769124697419]]

Solved...

Thanks a lot

the problem solved.....

Ph.D Candidate

Applied Mathematics Department

Thanks...

Dear's

Hope you best times

Regards

Ph.D Candidate

Applied Mathematics Department

I have write following

 > restart:alias(C=binomial):  with(linalg):  with(LinearAlgebra):  m:=3:    SpM:=proc(m::nonnegint)  Matrix([seq([0 \$ i, seq((-1)^k*C(m,i)*C(m-i,k), k=0..m-i)], i=0..m)]);  end:  A:=SpM(m):  Ainverse:=A^(-1):  Z:= DiagonalMatrix([seq(1/(i+1), i= 0..m)]):      C0:=proc(m::nonnegint)  Vector(m+1,i->C(m,i-1)/C(2*m+1,m+i)):    end:  C0(m):  C1:=Transpose(%):    B0:=Ainverse(2..m+1,1..-1):  B:=Matrix();
 (1)
 >
 >

is this right one?

Ph.D Candidate

Applied Mathematics Department