1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
Displaying information on action: optimize
Solves an optimization program defined by the input monomial ideal I, and an
input vector of integers v. The optimization program is
maximize v * e such that e encodes an irreducible component of I,
where * is dot product and e is a vector of integers that uniquely encodes an
irreducible ideal by being the exponent vector of the product of the
minimal generators.
The input is composed of the ideal I in any format, optionally followed by the
entries of v in a space separated list. If v is not explicitly specified,
then every entry is assumed to 1, i.e. then v is of the form (1, ..., 1).
This action has options for displaying the optimal value or not and for
displaying zero, one or all of the optimal solutions. The algorithm used to
solve the optimization program is the Slice Algorithm using the bound
optimization. Thus this action also has options related to that.
The parameters accepted by optimize are as follows.
-bound [BOOL] (default is on)
Use the bound optimization to solve optimization problems faster
by eliminating non-improving slices.
-boundSimplify [BOOL] (default is on)
Use the bound optimization to solve optimization problems faster by
simplifying slices through seeking to generate non-improving slices.
This requires turning elimination of non-improving slices on.
-canon [BOOL] (default is off)
Sort the output, including the variables, to get a canonical
representation. This requires storing the entire output in memory, which
can increase run time modestly and increase memory consumption greatly.
-chopFirstAndSubtract [BOOL] (default is off)
Remove the first variable from generators, from the ring and from v, and
subtract the value of the first entry of v from the reported optimal value.
This is useful for Frobenius number calculations.
-debug [BOOL] (default is off)
Print what the algorithm does at each step.
-displayLevel INTEGER (default is 0)
Controls how many optimal solutions to display. If the value is 0 or 1,
Frobby displays 0 or 1 solutions respectively. If the value is 2 or more,
all solutions are displayed. The output is presented as generators of a
monomial ideal.
-displayValue [BOOL] (default is on)
Display the optimal value of the optimization program.
-iformat STRING (default is autodetect)
The format used to read the input. This action supports the formats:
4ti2 cocoa4 m2 monos newmonos null singular.
The format "autodetect" instructs Frobby to guess the format.
Type 'frobby help io' for more information on input formats.
-maxStandard [BOOL] (default is off)
Solve the optimization program for maximal standard monomials instead of
for monomials representing irreducible components.
-minValue [BOOL] (default is off)
Minimize the value of v * e above. If this option is not set, maximize v * e
instead, as is the stated default above.
-minimal [BOOL] (default is off)
Specifies that the input ideal is minimally generated by the given
generators. Turning this on can improve performance, but if it is not
true then Frobby may go into an infinite loop or produce incorrect results.
-oformat STRING (default is input)
The format used to write the output. This action supports the formats:
4ti2 cocoa4 count m2 monos newmonos null singular.
The format "input" instructs Frobby to use the input format.
Type 'frobby help io' for more information on output formats.
-simplify [BOOL] (default is on)
Perform simplification when possible.
-split STRING (default is degree)
The split selection strategy to use. Slice options are maxlabel, minlabel,
varlabel, minimum, median, maximum, mingen, indep and gcd. Optimization
computations support the specialized strategy degree as well.
-stats [BOOL] (default is off)
Print statistics on what the algorithm did.
-time [BOOL] (default is off)
Display and time each subcomputation.
|
