Menu
▾
▴
[Maxima-commits] CVS: maxima/doc/info/pt Help.texi, 1.4, 1.5 maxima.texi, 1.42, 1.43 bode.texi, 1.1, 1.2 opsubst.texi, 1.1, 1.2 lbfgs.texi, 1.1, 1.2 simplex.texi, 1.1, 1.2
|
From: Jorge B. <fic...@us...> - 2006-12-09 13:24:57
|
Update of /cvsroot/maxima/maxima/doc/info/pt In directory sc8-pr-cvs7.sourceforge.net:/tmp/cvs-serv13354 Modified Files: Help.texi maxima.texi bode.texi opsubst.texi lbfgs.texi simplex.texi Log Message: Portuguese translation. bode.texi, opsubst.texi, lbfgs.texi, simplex.texi -> first translation. Help.texi -> changing Fun@,c@~ao by Fun@value{cedilha}@value{a_til}o. maxima.texi - inclusion of bode.texi, opsubst.texi, lbfgs.texi and simplex.texi Index: Help.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/Help.texi,v retrieving revision 1.4 retrieving revision 1.5 diff -u -d -r1.4 -r1.5 --- Help.texi 3 Dec 2006 15:31:58 -0000 1.4 +++ Help.texi 9 Dec 2006 13:24:49 -0000 1.5 @@ -235,7 +235,7 @@ @node Defini@value{cedilha}@~oes para Ajuda, , Documenta@value{cedilha}@~ao, Ajuda @section Defini@value{cedilha}@~oes para Ajuda -@deffn {Fun@,{c}@~ao} demo (@var{nomedearquivo}) +@deffn {Fun@value{cedilha}@~ao} demo (@var{nomedearquivo}) Avalia express@~oes Maxima em @var{nomedearquivo} e mostra os resultados. @code{demo} faz uma pausa ap@'os avaliar cada express@~ao e continua ap@'os a conclus@~ao com um enter das entradas de usu@'ario. @@ -325,8 +325,8 @@ @end deffn -@deffn {Fun@,{c}@~ao} describe (@var{string}) -@deffnx {Fun@,{c}@~ao} describe (@var{string}, exact) +@deffn {Fun@value{cedilha}@~ao} describe (@var{string}) +@deffnx {Fun@value{cedilha}@~ao} describe (@var{string}, exact) @code{describe(@var{string})} encontra todos os itens documentados que contiverem @var{string} em seus t@'itulos. Se existe mais de um de tal item, Maxima solicita ao usu@'ario selecionar um item ou @'itens para mostrar. @@ -378,8 +378,8 @@ @end deffn -@deffn {Fun@,{c}@~ao} example (@var{t@'opico}) -@deffnx {Fun@,{c}@~ao} example () +@deffn {Fun@value{cedilha}@~ao} example (@var{t@'opico}) +@deffnx {Fun@value{cedilha}@~ao} example () @code{example (@var{topic})} mostra alguns exemplos de @var{t@'opico}, que @'e um s@'imbolo (n@~ao uma seq@"u@^encia de caracteres). A maioria dos t@'opicos s@~ao nomes de fun@,{c}@~ao. Index: maxima.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/maxima.texi,v retrieving revision 1.42 retrieving revision 1.43 diff -u -d -r1.42 -r1.43 --- maxima.texi 29 Nov 2006 05:35:02 -0000 1.42 +++ maxima.texi 9 Dec 2006 13:24:49 -0000 1.43 @@ -261,7 +261,7 @@ Operadores -* N-Argumentos:: +* "N" Argumentos:: * Sem Argumentos:: * Operador:: * Operador P@'osfixado:: @@ -458,7 +458,7 @@ bode -* Definitions for bode:: +* Defini@value{cedilha}@~oes para bode:: cholesky @@ -510,8 +510,8 @@ lbfgs -* Introduction to lbfgs:: -* Definitions for lbfgs:: +* Introdu@value{cedilha}@~ao a lbfgs:: +* Defini@value{cedilha}@~oes para lbfgs:: lindstedt @@ -541,7 +541,7 @@ opsubst -* Definitions for opsubst:: +* Defini@value{cedilha}@~oes para opsubst:: orthopoly Index: bode.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/bode.texi,v retrieving revision 1.1 retrieving revision 1.2 diff -u -d -r1.1 -r1.2 --- bode.texi 5 Jul 2006 13:40:33 -0000 1.1 +++ bode.texi 9 Dec 2006 13:24:49 -0000 1.2 @@ -1,19 +1,21 @@ +@c Language: Portuguese, Encoding: iso-8859-1 +@c /bode.texi/1.1/Mon Feb 27 22:09:17 2006// @menu -* Definitions for bode:: +* Defini@value{cedilha}@~oes para bode:: @end menu -@node Definitions for bode, , bode, bode -@section Definitions for bode +@node Defini@value{cedilha}@~oes para bode, , bode, bode +@section Defini@value{cedilha}@~oes para bode -@deffn {Function} bode_gain (@var{H}, @var{range}, ...@var{plot_opts}...) -Function to draw Bode gain plots. +@deffn {Fun@value{cedilha}@~ao} bode_gain (@var{H}, @var{range}, ...@var{plot_opts}...) +Fun@,{c}@~ao para desenhar gr@'aficos de ganho para Bode. -Examples (1 through 7 from +Exemplos (1 a 7 provenientes de @example http://www.swarthmore.edu/NatSci/echeeve1/Ref/Bode/BodeHow.html, @end example -8 from Ron Crummett): +8 proveniente de Ron Crummett): @example (%i1) load("bode")$ @@ -52,18 +54,18 @@ (%i17) bode_gain (H8 (s), [w, 1/1000, 1000])$ @end example -To use this function write first @code{load("bode")}. See also @code{bode_phase} +Para usar essa fun@,{c}@~ao escreva primeiramente @code{load("bode")}. Veja tamb@'em @code{bode_phase} @end deffn -@deffn {Function} bode_phase (@var{H}, @var{range}, ...@var{plot_opts}...) -Function to draw Bode phase plots. +@deffn {Fun@value{cedilha}@~ao} bode_phase (@var{H}, @var{range}, ...@var{plot_opts}...) +Fun@,{c}@~ao para desenhar gr@'aficos de fase para Bode -Examples (1 through 7 from +Exemplos (1 a 7 provenientes de @example http://www.swarthmore.edu/NatSci/echeeve1/Ref/Bode/BodeHow.html, @end example -8 from Ron Crummett): +8 proveniente de Ron Crummett): @example (%i1) load("bode")$ @@ -108,6 +110,6 @@ bode_phase (H8 (s), [w, 1/1000, 1000])); @end example -To use this function write first @code{load("bode")}. See also @code{bode_gain} +Para usar essa fun@,{c}@~ao escreva primeiramente @code{load("bode")}. Veja tamb@'em @code{bode_gain} @end deffn Index: opsubst.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/opsubst.texi,v retrieving revision 1.1 retrieving revision 1.2 diff -u -d -r1.1 -r1.2 --- opsubst.texi 5 Jul 2006 13:40:33 -0000 1.1 +++ opsubst.texi 9 Dec 2006 13:24:49 -0000 1.2 @@ -1,23 +1,26 @@ +@c Language: Portuguese, Encoding: iso-8859-1 +@c /opsubst.texi/1.1/Mon Feb 27 22:09:17 2006// + @menu -* Definitions for opsubst:: +* Defini@value{cedilha}@~oes para opsubst:: @end menu -@node Definitions for opsubst, , opsubst, opsubst -@section Definitions for opsubst +@node Defini@value{cedilha}@~oes para opsubst, , opsubst, opsubst +@section Defini@value{cedilha}@~oes para opsubst -@deffn {Function} opsubst (@var{f},@var{g},@var{e}) -@deffnx {Function} opsubst (@var{g}=@var{f},@var{e}) -@deffnx {Function} opsubst ([@var{g1}=@var{f1},@var{g2}=@var{f2},..., @var{gn}=@var{fn}],@var{e}) -The function @code{opsubst} is similar to the function @code{subst}, except that -@code{opsubst} only makes substitutions for the operators in an expression. In general, -When @var{f} is an operator in the expression @var{e}, substitute @var{g} -for @var{f} in the expression @var{e}. +@deffn {Fun@value{cedilha}@~ao} opsubst (@var{f},@var{g},@var{e}) +@deffnx {Fun@value{cedilha}@~ao} opsubst (@var{g}=@var{f},@var{e}) +@deffnx {Fun@value{cedilha}@~ao} opsubst ([@var{g1}=@var{f1},@var{g2}=@var{f2},..., @var{gn}=@var{fn}],@var{e}) +A fun@,{c}@~ao @code{opsubst} similar @`a fun@,{c}@~ao @code{subst}, exceto que +@code{opsubst} somente faz substitui@,{c}@~oes para as opera@,{c}@~oes em uma express@~oes. Em geral, +quando @var{f} for um operador em uma express@~ao @var{e}, substitui @var{g} +por @var{f} na express@~ao @var{e}. -To determine the operator, @code{opsubst} sets @code{inflag} to true. This means -@code{opsubst} substitutes for the internal, not the displayed, operator -in the expression. +Para determinar o operador, @code{opsubst} escolhe @code{inflag} para verdadeiro ( true ). Isso significa que +@code{opsubst} substitui para a forma de operador interna, n@~ao para a mostrada, +na express@~ao. -Examples: +Exemplos: @example (%i1) load (opsubst)$ @@ -36,8 +39,8 @@ (%o7) h(x) @end example -Internally, Maxima does not use the unary negation, -division, or the subtraction operators; thus: +Internamente, Maxima n@~ao usa os operadores de nega@,{c}@~ao un@'aria, +divis@~ao, ou de subtra@,{c}@~ao; dessa forma: @example (%i8) opsubst("+","-",a-b); (%o8) a - b @@ -49,14 +52,14 @@ b @end example -The internal representation of -a*b is *(-1,a,b); thus +A representa@,{c}@~ao interna de -a*b @'e *(-1,a,b); dessa forma @example (%i11) opsubst("[","*", -a*b); (%o11) [- 1, a, b] @end example -When either operator isn't a Maxima symbol, generally some other function -will signal an error: +Quando o operador n@~ao for um s@'imbolo Maxima, geralmente alguma outra fun@,{c}@~ao +sinalizar@'a um erro: @example (%i12) opsubst(a+b,f, f(x)); @@ -65,13 +68,13 @@ -- an error. Quitting. To debug this try debugmode(true); @end example -However, subscripted operators are allowed: +Todavia, operadores subscritos s@~ao permitidos: @example (%i13) opsubst(g[5],f, f(x)); (%o13) g (x) 5 @end example -To use this function write first @code{load("opsubst")}. +Para usar essa fun@,{c}@~ao escreva primeiramente @code{load("opsubst")}. @end deffn Index: lbfgs.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/lbfgs.texi,v retrieving revision 1.1 retrieving revision 1.2 diff -u -d -r1.1 -r1.2 --- lbfgs.texi 26 Nov 2006 18:02:39 -0000 1.1 +++ lbfgs.texi 9 Dec 2006 13:24:49 -0000 1.2 @@ -1,78 +1,81 @@ +@c Language: Portuguese, Encoding: iso-8859-1 +@c /lbfgs.texi/1.2/Sat Dec 9 06:10:42 2006// + @menu -* Introduction to lbfgs:: -* Definitions for lbfgs:: +* Introdu@value{cedilha}@~ao a lbfgs:: +* Defini@value{cedilha}@~oes para lbfgs:: @end menu -@node Introduction to lbfgs, Definitions for lbfgs, Top, Top -@section Introduction to lbfgs +@node Introdu@value{cedilha}@~ao a lbfgs, Defini@value{cedilha}@~oes para lbfgs, Top, Top +@section Introdu@value{cedilha}@~ao a lbfgs -@code{lbfgs} is an implementation of the L-BFGS algorithm [1] -to solve unconstrained minimization problems via a limited-memory quasi-Newton (BFGS) algorithm. -It is called a limited-memory method because a low-rank approximation of the -Hessian matrix inverse is stored instead of the entire Hessian inverse. -The program was originally written in Fortran [2] by Jorge Nocedal, -incorporating some functions originally written by Jorge J. Mor@'{e} and David J. Thuente, -and translated into Lisp automatically via the program @code{f2cl}. -The Maxima package @code{lbfgs} comprises the translated code plus -an interface function which manages some details. +@code{lbfgs} @'e uma implementa@,{c}@~ao do algor@'itmo[1] L-BFGS (Broyden-Fletcher-Goldfarb-Shanno) +para resolver problemas de minimiza@,{c}@~ao n@~ao limitada atrav@'es de um algor@'itmo de mem@'oria limitada quasi-Newton (BFGS). +Esse algor@'itmo @'e chamado de m@'etodo de mem@'oria limitada porque uma aproxima@,{c}@~ao de baixo ranque da +inverso da matriz Hessiana @'e armazenado em lugar da inversa da matriz Hessiana completa. +O programa foi escrito origin@'ariamente em Fortran [2] por Jorge Nocedal, +incorporando algumas fun@,{c}@~oes originalmente escritas por Jorge J. Mor@'{e} e David J. Thuente, +e traduzidas para Lisp automaticamente atrav@'es do programa @code{f2cl}. +O pacote do Maxima @code{lbfgs} compreende o c@'odigo traduzido e adicionalmente +uma interface de fun@,{c}@~ao que gerencia alguns detallhes. -References: +Refer@^encias: [1] D. Liu and J. Nocedal. "On the limited memory BFGS method for large scale optimization". @i{Mathematical Programming B} 45:503--528 (1989) [2] http://netlib.org/opt/lbfgs_um.shar -@node Definitions for lbfgs, , Introduction to lbfgs, Top -@section Definitions for lbfgs +@node Defini@value{cedilha}@~oes para lbfgs, , Introdu@value{cedilha}@~ao a lbfgs, Top +@section Defini@value{cedilha}@~oes para lbfgs -@deffn {Function} lbfgs (@var{FOM}, @var{X}, @var{X0}, @var{epsilon}, @var{iprint}) +@deffn {Fun@value{cedilha}@~ao} lbfgs (@var{FOM}, @var{X}, @var{X0}, @var{epsilon}, @var{iprint}) -Finds an approximate solution of the unconstrained minimization of the figure of merit @var{FOM} -over the list of variables @var{X}, -starting from initial estimates @var{X0}, -such that @math{norm grad FOM < epsilon max(1, norm X)}. +Encontra uma solu@,{c}@~ao aproximada da minimiza@,{c}@~ao n@~ao limitada de n@'umero de m@'erito @var{FOM} +sobre a lista de vari@'aveis @var{X}, +come@,{c}ando a partir da estimativa inicial @var{X0}, +tal que @math{norm grad FOM < epsilon max(1, norm X)}. -The algorithm applied is a limited-memory quasi-Newton (BFGS) algorithm [1]. -It is called a limited-memory method because a low-rank approximation of the -Hessian matrix inverse is stored instead of the entire Hessian inverse. +O algor@'itmo aplicado @'e um algor@'itmo de mem@'oria limitada[1] quasi-Newton (BFGS). +Esse algor@'itmo @'e chamado de m@'etodo de mem@'oria limitada porque uma aproxima@,{c}@~ao de baixo ranque da +inverso da matriz Hessiana @'e armazenado em lugar da inversa da matriz Hessiana completa. -@var{iprint} controls progress messages printed by @code{lbfgs}. +@var{iprint} controla as messaens de progresso mostradas atrav@'es de @code{lbfgs}. @table @code @item iprint[1] -@code{@var{iprint}[1]} controls the frequency of progress messages. +@code{@var{iprint}[1]} controla a freq@"u@^encia das mensagens de progresso. @table @code @item iprint[1] < 0 -No progress messages. +Nenhuma mensagem de progresso. @item iprint[1] = 0 -Messages at the first and last iterations. +Messagens na primeira itera@,{c}@~ao e na @'ultima itera@,{c}@~ao. @item iprint[1] > 0 -Print a message every @code{@var{iprint}[1]} iterations. +Mostra uma mensagem a cada @code{@var{iprint}[1]} itera@,{c}@~oes. @end table @item iprint[2] -@code{@var{iprint}[2]} controls the verbosity of progress messages. +@code{@var{iprint}[2]} controla a quantidade de informa@,{c}@~oes fornecidas pelas mensagens de progresso (verbosidade). @table @code @item iprint[2] = 0 -Print out iteration count, number of evaluations of @var{FOM}, value of @var{FOM}, -norm of the gradient of @var{FOM}, and step length. +Mostra na tela o contador de itera@,{c}@~oes, o n@'umero de avalia@,{c}@~oes de @var{FOM}, o valor de @var{FOM}, +a norma do gradiente de @var{FOM}, e o comprimento do salto. @item iprint[2] = 1 -Same as @code{@var{iprint}[2] = 0}, plus @var{X0} and the gradient of @var{FOM} evaluated at @var{X0}. +O mesmo que @code{@var{iprint}[2] = 0}, adicionando @var{X0} e o gradiente de @var{FOM} avaliado em @var{X0}. @item iprint[2] = 2 -Same as @code{@var{iprint}[2] = 1}, plus values of @var{X} at each iteration. +O mesmo que @code{@var{iprint}[2] = 1}, adicionando valores de @var{X} a cada itera@,{c}@~ao. @item iprint[2] = 3 -Same as @code{@var{iprint}[2] = 2}, plus the gradient of @var{FOM} at each iteration. +O mesmo que @code{@var{iprint}[2] = 2}, adicionando o gradiente de @var{FOM} a cada itera@,{c}@~ao. @end table @end table -See also @code{lbfgs_nfeval_max} and @code{lbfgs_ncorrections}. +Veja tamb@'em @code{lbfgs_nfeval_max} e @code{lbfgs_ncorrections}. -References: +Refer@^encias: [1] D. Liu and J. Nocedal. "On the limited memory BFGS method for large scale optimization". @i{Mathematical Programming B} 45:503--528 (1989) -Example: +Exemplo: @c ===beg=== @c load (lbfgs); @@ -144,12 +147,12 @@ @end deffn -@defvr {Variable} lbfgs_nfeval_max -Default value: 100 +@defvr {Vari@value{a_til}vel} lbfgs_nfeval_max +Valor padr@~ao: 100 @end defvr -@defvr {Variable} lbfgs_ncorrections -Default value: 25 +@defvr {Vari@value{a_til}vel} lbfgs_ncorrections +Valor padr@~ao: 25 @end defvr Index: simplex.texi =================================================================== RCS file: /cvsroot/maxima/maxima/doc/info/pt/simplex.texi,v retrieving revision 1.1 retrieving revision 1.2 diff -u -d -r1.1 -r1.2 --- simplex.texi 5 Jul 2006 13:40:33 -0000 1.1 +++ simplex.texi 9 Dec 2006 13:24:49 -0000 1.2 @@ -1,14 +1,16 @@ +@c Language: Portuguese, Encoding: iso-8859-1 +@c /simplex.texi/1.2/Mon May 15 07:55:16 2006// @menu -* Introduction to simplex:: -* Definitions for simplex:: +* Introdu@value{cedilha}@~ao a simplex:: +* Defini@value{cedilha}@~oes para simplex:: @end menu -@node Introduction to simplex, Definitions for simplex, simplex, simplex -@section Introduction to simplex +@node Introdu@value{cedilha}@~ao a simplex, Defini@value{cedilha}@~oes para simplex, simplex, simplex +@section Introdu@value{cedilha}@~ao a simplex -@code{simplex} is a package for linear optimization using the simplex algorithm. +@code{simplex} @'e um pacote para otimiza@,{c}@~ao linear usando o algor@'itmo simplex. -Example: +Exemplo: @c ===beg=== @c load("simplex")$ @@ -22,32 +24,32 @@ 10 10 5 @end example -@node Definitions for simplex, , Introduction to simplex, simplex -@section Definitions for simplex +@node Defini@value{cedilha}@~oes para simplex, , Introdu@value{cedilha}@~ao a simplex, simplex +@section Defini@value{cedilha}@~oes para simplex -@defvr {Option variable} epsilon_sx -Default value: @code{10^-8} +@defvr {Vari@value{a_agu}vel de op@value{cedilha}@value{a_til}o} epsilon_sx +Valor padr@~ao: @code{10^-8} -Epsilon used for numerical computations in @code{linear_program}. +Epsilon usando para c@'alculos num@'ericos em @code{linear_program}. -See also: @code{linear_program}. +Veja tamb@'em: @code{linear_program}. @end defvr -@deffn {Function} linear_program (@var{A}, @var{b}, @var{c}) +@deffn {Fun@value{cedilha}@~ao} linear_program (@var{A}, @var{b}, @var{c}) -@code{linear_program} is an implementation of the simplex algorithm. -@code{linear_program(A, b, c)} computes a vector @var{x} for which @code{c.x} is minimum -possible among vectors for which @code{A.x = b} and @code{x >= 0}. Argument -@var{A} is a matrix and arguments @var{b} and @var{c} are lists. +@code{linear_program} @'e uma implementa@,{c}@~ao do algor@'itmo simplex. +@code{linear_program(A, b, c)} calcula um vetor @var{x} para o qual @code{c.x} @'e o m@'inimo +poss@'ivel entre vetores para os quais @code{A.x = b} e @code{x >= 0}. O argumento +@var{A} @'e uma matriz e os argumentos @var{b} e @var{c} s@~ao listas. -@code{linear_program} returns a list which contains the minimizing vector @var{x} and the -minimum value @code{c.x}. If the problem is not bounded, it returns "Problem not bounded!" and -if the problem is not feasible, it returns "Problem not feasible!". +@code{linear_program} retorna uma lista contendo o vetor minimizado @var{x} e o +valor m@'inimo @code{c.x}. Se o problema for n@~ao associado, @'e retornado "Problem not bounded!" e +se o problema for n@~ao vi@'avel, @'e retornado "Problem not feasible!". -To use this function first load the @code{simplex} package with @code{load(simplex);}. +Para usar essa fun@,{c}@~ao primeiramente chame o pacote @code{simplex} com @code{load(simplex);}. -Example: +Exemplo: @c ===beg=== @c A: matrix([1,1,-1,0], [2,-3,0,-1], [4,-5,0,0])$ @@ -65,47 +67,47 @@ 2 2 2 @end example -See also: @code{minimize_sx}, @code{scale_sx}, and @code{epsilon_sx}. +Veja tamb@'em: @code{minimize_sx}, @code{scale_sx}, e @code{epsilon_sx}. @end deffn -@deffn {Function} maximize_sx (@var{obj}, @var{cond}, [@var{pos}]) +@deffn {Fun@value{cedilha}@~ao} maximize_sx (@var{obj}, @var{cond}, [@var{pos}]) -Maximizes linear objective function @var{obj} subject to some linear constraints -@var{cond}. See @code{minimize_sx} for detailed description of arguments and return -value. +Maximiza a fun@,{c}@~ao linear objetiva @var{obj} submetida a alguma restri@,{c}@~ao linear +@var{cond}. Veja @code{minimize_sx} para uma descri@,{c}@~ao detalhada de argumentos e valores de +retorno. -See also: @code{minimize_sx}. +Veja tamb@'em: @code{minimize_sx}. @end deffn -@deffn {Function} minimize_sx (@var{obj}, @var{cond}, [@var{pos}]) +@deffn {Fun@value{cedilha}@~ao} minimize_sx (@var{obj}, @var{cond}, [@var{pos}]) -Minimizes a linear objective function @var{obj} subject to some linear -constraints @var{cond}. @var{cond} a list of linear equations or -inequalities. In strict inequalities @code{>} is replaced by @code{>=} -and @code{<} by @code{<=}. The optional argument @var{pos} is a list of -decision variables which are assumed to be positive. +Minimiza uma fun@,{c}@~ao linear objetiva @var{obj} submetida a alguma restri@,{c}@~ao +linear @var{cond}. @var{cond} @'e uma lista de equa@,{c}@~oes lineares ou +desigualdades. Em desigualdades estritas @code{>} @'e substituido por @code{>=} +e @code{<} por @code{<=}. O argumento opcional @var{pos} @'e uma lista de +vari@'aveis de decis@~ao que s@~ao assumidas como sendo positivas. -If the minimum exists, @code{minimize_sx} returns a list which contains -the minimum value of the objective function and a list of decision variable -values for which the minimum is attained. If the problem is not bounded, -@code{minimize_sx} returns "Problem not bounded!" and if the problem -is not feasible, it returns "Ploblem not feasible!". +Se o m@'inimo existir, @code{minimize_sx} retorna uma lista que cont@'em +o menor valor da fun@,{c}@~ao objetiva e uma lista de valores de vari@'aveis de +decis@~ao para os quais o m@'inimo @'e alcan@,{c}ado. Se o problema for n@~ao associado, +@code{minimize_sx} retorna "Problem not bounded!" e se o problema for +n@~ao vi@'avel, @'e retornado "Ploblem not feasible!". -The decision variables are not assumed to be nonegative by default. If all -decision variables are nonegative, set @code{nonegative_sx} to @code{true}. -If only some of decision variables are positive, list them in the optional -argument @var{pos} (note that this is more efficient than adding -constraints). +As vari@'aveis de decis@~ao n@~ao s@~ao assumidas para serem n@~ao negativas por padr@~ao. Se todas +as vari@'aveis de dicis@~ao forem n@~ao negativas, escolha @code{nonegative_sx} para @code{true}. +Se somente algumas das vari@'aveis de decis@~ao forem positivas, coloque-as ent@~ao no argumento +opcional @var{pos} (note que isso @'e mais eficiente que adicionar +restri@,{c}@~oes). -@code{minimize_sx} uses the simplex algorithm which is implemented in maxima -@code{linear_program} function. +@code{minimize_sx} utiliza o algor@'itmo simplex que @'e implementado na fun@,{c}@~ao +@code{linear_program} do Maxima. -To use this function first load the @code{simplex} package with @code{load(simplex);}. +Para usar essa fun@,{c}@~ao primeiramente chame o pacote @code{simplex} com @code{load(simplex);}. -Examples: +Exemplos: @c ===beg=== @c minimize_sx(x+y, [3*x+y=0, x+2*y>2]); @@ -127,16 +129,16 @@ @end example -See also: @code{maximize_sx}, @code{nonegative_sx}, @code{epsilon_sx}. +Veja tamb@'em: @code{maximize_sx}, @code{nonegative_sx}, @code{epsilon_sx}. @end deffn -@defvr {Option variable} nonegative_sx -Default value: @code{false} +@defvr {Vari@value{a_agu}vel de op@value{cedilha}@value{a_til}o} nonegative_sx +Valor padr@~ao: @code{false} -If @code{nonegative_sx} is true all decision variables to @code{minimize_sx} -and @code{maximize_sx} are assumed to be positive. +Se @code{nonegative_sx} for verdadeiro (true) todas as vari@'aveis de decis@~ao para @code{minimize_sx} +e @code{maximize_sx} s@~ao assumidas para serem positivas. -See also: @code{minimize_sx}. +Veja tamb@'em: @code{minimize_sx}. @end defvr |