naginterfaces.library.opt.qpconvex1_sparse_mps¶

naginterfaces.library.opt.qpconvex1_sparse_mps(infile, maxn, maxm, maxnnz, xbldef, xbudef, mpslst, names, io_manager=None)[source]¶

qpconvex1_sparse_mps reads data for a sparse linear programming or quadratic programming problem from an external file which is in standard or compatible MPSX input format.

Deprecated since version 26.2.0.0: qpconvex1_sparse_mps is deprecated. Please use miqp_mps_read() instead. See also the Replacement Calls document.

For full information please refer to the NAG Library document for e04mz

https://support.nag.com/numeric/nl/nagdoc_30.2/flhtml/e04/e04mzf.html

Parameters

infileint

The unit number (see unit_from_fileobj()) associated with the MPSX data file.

maxnint

An upper limit for the number of variables in the problem.

maxmint

An upper limit for the number of constraints (including the objective row) in the problem.

maxnnzint

An upper limit for the number of nonzeros (including the objective row) in the problem.

xbldeffloat

The default lower bound to be used for the variables in the problem when none is specified in the BOUNDS section of the MPSX data file. For a standard LP or QP problem $x b l d e f$ would normally be set to zero.

xbudeffloat

The default upper bound to be used for the variables in the problem when none is specified in the BOUNDS section of the MPSX data file. For a standard LP or QP problem $x b u d e f$ would normally be set to ‘infinity’ (i.e., $x b u d e f \geq 10^{20}$ ).

mpslstbool

If $m p s l s t = T r u e$ , a listing of the input data is sent to the file object associated with the advisory I/O unit (see FileObjManager). This can be useful for debugging the MPSX data file. If $m p s l s t = F a l s e$ , no listing is produced.

namesstr, length 8, array-like, shape $(5)$

A set of names associated with the MPSX form of the problem.

$n a m e s [0]$

Must contain either the name of the problem or be blank.

$n a m e s [1]$

Must contain either the name of the objective row or be blank (in which case the first objective free row is used).

$n a m e s [2]$

Must contain either the name of the RHS set to be used or be blank (in which case the first RHS set is used).

$n a m e s [3]$

Must contain either the name of the RANGE set to be used or be blank (in which case the first RANGE set (if any) is used).

$n a m e s [4]$

Must contain either the name of the BOUNDS set to be used or be blank (in which case the first BOUNDS set (if any) is used).

io_managerFileObjManager, optional

Manager for I/O in this routine.

Returns

nint

$n$ , the actual number of variables in the problem.

mint

$m$ , the actual number of general linear constraints in the problem (including the objective row).

nnzint

The actual number of nonzeros in the problem (including the objective row).

iobjint

If $i o b j > 0$ , row $i o b j$ of $A$ is a free row containing the nonzero coefficients of the vector $c$ .

If $i o b j = 0$ , the coefficients of $c$ are assumed to be zero.

If $i o b j = - 1$ , no such row was found and the function terminates with $e r r n o$ = 4 or 5 (see Exceptions).

ncolhint

$n c o l h = 0$ . For QP problems, $n c o l h$ is the number of leading nonzero columns of the Hessian matrix $H$ and must, therefore, be set $> 0$ before calling qpconvex1_sparse_solve().

afloat, ndarray, shape $(m a x n n z)$

The nonzero elements of $A$ , ordered by increasing column index.

haint, ndarray, shape $(m a x n n z)$

The row indices of the nonzero elements stored in $a$ .

kaint, ndarray, shape $(m a x n + 1)$

A set of pointers to the beginning of each column of $A$ . More precisely, $k a [i - 1]$ contains the index in $a$ of the start of the $i$ th column, for $i = 1, 2, \dots, n$ . Note that $k a [0] = 1$ and $k a [n] = n n z + 1$ .

blfloat, ndarray, shape $(m a x n + m a x m)$

$b l$ contains the vector $l$ (the lower bounds) for all the variables and constraints

bufloat, ndarray, shape $(m a x n + m a x m)$

$b u$ contains the vector $u$ (the upper bounds) for all the variables and constraints

startstr, length 1

$s t a r t ='C'$ and an internal Crash procedure will be used by qpconvex1_sparse_solve() to choose an initial basis.

namesstr, length 8, ndarray, shape $(5)$

A set of names associated with the problem as defined in the MPSX data file as follows:

$n a m e s [0]$

Contains the name of the problem (or blank if none).

$n a m e s [1]$

Contains the name of the objective row (or blank if none).

$n a m e s [2]$

Contains the name of the RHS set (or blank if none).

$n a m e s [3]$

Contains the name of the RANGE set (or blank if none).

$n a m e s [4]$

Contains the name of the BOUNDS set (or blank if none).

nnameint

$n + m$ , the total number of variables and constraints in the problem.

crnamestr, length 8, ndarray, shape $(m a x n + m a x m)$

The MPSX names of all the variables and constraints in the problem in the following order. The first $n$ elements contain the MPSX names for the variables and the next $m$ elements contain the MPSX names for the objective row and general linear constraints (if any). Note that the MPSX name for the objective row is stored in $c r n a m e [n + i o b j - 1]$ .

xsfloat, ndarray, shape $(m a x n + m a x m)$

A set of initial values for the variables and constraints in the problem. More precisely, $x s [j - 1] = m i n (m a x (0.0, b l [j - 1]), b u [j - 1])$ , for $j = 1, 2, \dots, n n a m e$ .

istateint, ndarray, shape $(m a x n + m a x m)$

A set of initial states for the variables and constraints in the problem. More precisely, $i s t a t e [j - 1] = 1$ if $x s [j - 1] = b u [j - 1]$ and $0$ otherwise, for $j = 1, 2, \dots, n n a m e$ .

Raises

NagValueError

(errno $1$ )

Too many rows. Limit is $⟨ v a l u e ⟩$ , but the actual number required is $⟨ v a l u e ⟩$ .

(errno $2$ )

Too many columns. Limit is $⟨ v a l u e ⟩$ , but the actual number required is $⟨ v a l u e ⟩$ .

(errno $3$ )

Too many nonzeros. Limit is $⟨ v a l u e ⟩$ , but the actual number required is $⟨ v a l u e ⟩$ .

(errno $4$ )

No objective row found.

(errno $5$ )

Objective row name $⟨ v a l u e ⟩$ is not defined in the ROWS section.

(errno $6$ )

No rows specified.

(errno $7$ )

Illegal constraint type $⟨ v a l u e ⟩$ .

(errno $8$ )

Row name with leading blank or non-alphanumeric character: $⟨ v a l u e ⟩$ .

(errno $9$ )

Column name with leading blank or non-alphanumeric character: $⟨ v a l u e ⟩$ .

(errno $10$ )

Illegal bound type $⟨ v a l u e ⟩$ .

(errno $11$ )

Column name $⟨ v a l u e ⟩$ is not defined in the COLUMNS section.

(errno $12$ )

The last line must be the ENDATA indicator line.

(errno $13$ )

Line $⟨ v a l u e ⟩$ is not a comment nor a valid line.

(errno $14$ )

Row name $⟨ v a l u e ⟩$ is not defined in the ROWS section.

(errno $15$ )

No columns specified.

(errno $16$ )

BOUNDS name $⟨ v a l u e ⟩$ was not found.

(errno $16$ )

RANGES name $⟨ v a l u e ⟩$ was not found.

(errno $16$ )

RHS name $⟨ v a l u e ⟩$ was not found.

(errno $17$ )

On entry, $x b l d e f = ⟨ v a l u e ⟩$ and $x b u d e f = ⟨ v a l u e ⟩$ .

Constraint: $x b l d e f \leq x b u d e f$ .

(errno $17$ )

On entry, $m a x n n z = ⟨ v a l u e ⟩$ .

Constraint: $m a x n n z \geq 1$ .

(errno $17$ )

On entry, $m a x m = ⟨ v a l u e ⟩$ .

Constraint: $m a x m \geq 1$ .

(errno $17$ )

On entry, $m a x n = ⟨ v a l u e ⟩$ .

Constraint: $m a x n \geq 1$ .

(errno $17$ )

On entry, $i n f i l e = ⟨ v a l u e ⟩$ .

Constraint: $0 \leq i n f i l e \leq 2147483647$ .

Notes

In the NAG Library the traditional C interface for this routine uses a different algorithmic base. Please contact NAG if you have any questions about compatibility.

qpconvex1_sparse_mps reads Linear Programming (LP) or Quadratic Programming (QP) problem data from an external file which is prepared in standard or compatible MPSX (see IBM (1971)) input format and then initializes $n$ (the number of variables), $m$ (the number of general linear constraints), the $m \times n$ matrix $A$ , and the vectors $l$ , $u$ and $c$ (stored in row $i o b j$ of $A$ ) for use with qpconvex1_sparse_solve(), which is designed to solve problems of the form

\begin{matrix} {m i n i m i z e}_{x \in R^{n}} c^{T} x + \frac{1}{2} x^{T} H x subject to l \leq {\begin{matrix} x A x \end{matrix}} \leq u . \end{matrix}

For LP problems, $H = 0$ . For QP problems, you must set $n c o l h > 0$ (see Parameters) and provide a function to qpconvex1_sparse_solve() to compute $H x$ for any given vector $x$ . The option ‘Maximize’ may be used to specify an alternative problem in which the objective function is maximized (see Other Parameters for qpconvex1_sparse_solve).

MPSX input format

The input file of data may only contain two types of lines:

Indicator lines (specifying the type of data which is to follow).
Data lines (specifying the actual data).

The input file must not contain any blank lines. Any characters beyond column 80 are ignored. Indicator lines must not contain leading blank characters (in other words they must begin in column 1). The following displays the order in which the indicator lines must appear in the file:

NAME		user-supplied name
ROWS
	data line(s)
COLUMNS
	data line(s)
RHS
	data line(s)
RANGES		(optional)
	data line(s)
BOUNDS		(optional)
	data line(s)
ENDATA

The ‘user-supplied name’ specifies a name for the problem and must occupy columns $15 - 22$ . The name can either be blank or up to a maximum of $8$ characters.

A data line follows the same fixed format made up of fields defined below. The contents of the fields may have different significance depending upon the section of data in which they appear.

	Field 1	Field 2	Field 3	Field 4	Field 5	Field 6
Columns	$2 - 3$	$5 - 12$	$15 - 22$	$25 - 36$	$40 - 47$	$50 - 61$
Contents	Code	Name	Name	Value	Name	Value

The names and codes consist of ‘alphanumeric’ characters (i.e., a–z, A–Z, $0$ – $9$ , $+$ , $-$ , $*$ , blank (), :, $ or full stop (.) only) and the names must not contain leading blank characters. Values are read using Fortran format $e 12.0$ . This allows values to be entered in several equivalent forms. For example, $1.2345678$ , $1.2345678 e + 0$ , $123.45678 e - 2$ and $12345678 e - 07$ all represent the same number. It is safest to include an explicit decimal point.

Note that in order to ensure numeric values are interpreted as intended, they should be right-justified in the $12$ -character field, with no trailing blanks. This is because in some situations trailing blanks may be interpreted as zeros and this can dramatically affect the interpretation of the value. This is relevant if the value contains an exponent, or if it contains neither an exponent nor an explicit decimal point. For example, the fields

%%%%1.23e-2%
%%%%%%%123%%

may be interpreted as $1.23 e - 20$ and $12300$ respectively (where % denotes a blank). The actual behaviour is system-dependent.

Comment lines are allowed in the data file. These must have an asterisk (*) in column 1 and any characters in columns 2–80. In any data line, a dollar sign ($) as the first character in Field 3 or 5 indicates that the information from that point through column 80 consists of comments.

Columns outside the six fields must be blank, except for columns 72–80, whose contents are ignored by the function. These columns may be used to enter a sequence number. A non-blank character outside the predefined six fields and columns 72–80 is considered to be a major error ( $e r r n o$ = 13; see Exceptions), unless it is part of a comment.

ROWS Data Lines

These lines specify row (constraint) names and their inequality types (i.e., $=$ , $\geq$ or $\leq$ ).

Field 1:

defines the constraint type. It may be in column 2 or column 3.

`N`	free row, that is no constraint. It may be used to define the objective row.
`G`	greater than or equal to (i.e., $\geq$ ).
`L`	less than or equal to (i.e., $\leq$ ).
`E`	exactly equal to (i.e., $=$ ).

Field 2:

defines the row name.

Row type N stands for ‘Not binding’, also known as ‘Free’. It can be used to define the objective row. The objective row is a free row that specifies the vector $c$ in the linear objective term $c^{T} x$ . It is taken to be the first free row, unless some other free row name is specified by the $n a m e s$ array (see Parameters). Note that $c$ is assumed to be zero if (for example) the line

%N%%DUMMYROW

(where % denotes a blank) appears in the ROWS section of the MPSX data file, and the row name DUMMYROW is omitted from the COLUMNS section.

COLUMNS Data Lines

These lines specify the names to be assigned to the variables (columns) in the general linear constraint matrix $A$ , and define, in terms of column vectors, the actual values of the corresponding matrix elements.

Field 1:	blank (ignored).
Field 2:	gives the name of the column associated with the elements specified in the following fields.
Field 3:	contains the name of a row.
Field 4:	used in conjunction with Field 3 contains the value of the matrix element.
Field 5:	is optional (may be used like Field 3).
Field 6:	is optional (may be used like Field 4).

Note that only the nonzero elements of $A$ and $c$ need to be specified in the COLUMNS section, as any zero elements of $A$ are removed and any unspecified elements of $c$ are assumed to be zero. In addition, any nonzero elements in the $j$ th column of $A$ must be grouped together before those in the $(j + 1)$ th column, for $j = 1, 2, \dots, n - 1$ . Nonzero elements within a column may however appear in any order.

RHS Data Lines

This section specifies the right-hand side values of the general linear constraint matrix $A$ (if any). The lines specify the name to be given to the right-hand side (RHS) vector along with the numerical values of the elements of the vector, which may appear in any order. The data lines have exactly the same format as the COLUMNS data lines, except that the column name is replaced by the RHS name. Only the nonzero elements need be specified. Note that this section may be empty, in which case the RHS vector is assumed to be zero.

RANGES Data Lines (optional)

Ranges are used for constraints of the form $l \leq A x \leq u$ , where both $l$ and $u$ are finite. The range of the constraint is $r = u - l$ . Either $l$ or $u$ must be specified in the RHS section and $r$ must be defined in this section. The data lines have exactly the same format as the COLUMNS data lines, except that the column name is replaced by the RANGES name.

BOUNDS Data Lines (optional)

These lines specify limits on the values of the variables ( $l$ and $u$ in $l \leq x \leq u$ ). If the variable is not specified in the bound set then it is automatically assumed to lie between default lower and upper bounds (usually $0$ and $+ \infty$ ). Like an RHS column which is given a name, the set of variables in one bound set is also given a name.

Field 1:

LO	lower bound
UP	upper bound
FX	fixed variable
FR	free variable ( $- \infty$ to $+ \infty$ )
MI	lower bound is $- \infty$
PL	upper bound is $+ \infty$ . This is the default variable type.

Field 2:

identifies a name for the bound set.

Field 3:

identifies the column name of the variable belonging to this set.

Field 4:

identifies the value of the bound; this has a numerical value only in association with LO, UP, FX in Field 1, otherwise it is blank.

Field 5:

is blank and ignored.

Field 6:

is blank and ignored.

Note that if RANGES and BOUNDS sections are both present, the RANGES section must appear first.

References: IBM, 1971, MPSX – Mathematical programming system, Program Number 5734 XM4, IBM Trade Corporation, New York

NAG and Python

Return to Front

naginterfaces.library.opt.qpconvex1_sparse_mps¶

naginterfaces.library.opt.qpconvex1_​sparse_​mps¶

naginterfaces.library.opt.qpconvex1_sparse_mps¶