File: rational_qp_solver.data

package info (click to toggle)
cgal 6.1.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 144,952 kB
  • sloc: cpp: 811,597; ansic: 208,576; sh: 493; python: 411; makefile: 286; javascript: 174
file content (56 lines) | stat: -rw-r--r-- 1,721 bytes parent folder | download | duplicates (12)
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
# data file for specifying a quadratic program of the form
# minimize    c^T x + x^T D x
# subject to
#             A x {<=, =, >=} b
#             l <= x <= u 
# -------------------------------------------------------------------------
# Comments like this may appear but only before "HEADER".
#
# The number-type must be 
#   "integer" (all coefficients below are integers), or
#   "rational"(all coefficients below are rational numbers), or
#   "double" (all coefficients below are floating point numbers).
# The number-type specification must come before the default-bound. 
#
# The default-bound may be 
#    "nonnegative" (0 <= xi <= +infty), or 
#    "free" (-infty <= xi <= +infty). 
# If no default-bound is given, "nonnegative" is assumed. 
#
# The CONSTRAINTS section prescribes the system A x {<=, =, >=} b in
# dense format. It is mandatory. 
#
# The "D-MATRIX" section prescribes the matrix D in dense format. It is
# optional (defaulting to the zero matrix).
#
# The C-VECTOR-AND-BOUNDS prescribes the vector c (first entry) and the 
# bound vectors l and u (pair in brackets, where a missing entry means 
# plus or minus infinity. A missing pair means that the respective variable
# assumes the default bounds. The C-VECTOR-AND-BOUNDS section is mandatory.
#
# -------------------------------------------------------------------------
# 
# The following is therefore the quadratic program
#
# minimize (x0-1/3)^2 + (x1-1/3)^ + (x2-1/3)^2 - 1/3
# subject to 
#            x0 + x1 + x2 = 1

HEADER
number-type: rational
number-of-variables: 3
number-of-constraints: 1
default-bound: free

CONSTRAINTS
1/1 1/1 1/1  = 1/1

D-MATRIX
1/1 0/1 0/1
0/1 1/1 0/1
0/1 0/1 1/1

C-VECTOR-AND-BOUNDS
-2/3 -2/3 -2/3

END