QpConstraint

it.grypho.scala.leonardo.optimize.QpConstraint

One constraint of a qpSolve problem, named the way a reader names it: a row of A, or the lower or upper bound of one variable. Indices are zero-based; the REPL prints them from one. The name is what makes a warm start survive a perturbed problem: it does not depend on which bounds happen to be finite this time.

Attributes

Graph
Supertypes
trait Enum
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all

Members list

Type members

Enum entries

final case class Lower(i: Int)

The lower bound lb(i) ≤ z(i).

The lower bound lb(i) ≤ z(i).

Attributes

final case class Row(k: Int)

Row k of the inequality block A z ≤ b.

Row k of the inequality block A z ≤ b.

Attributes

final case class Upper(i: Int)

The upper bound z(i) ≤ ub(i).

The upper bound z(i) ≤ ub(i).

Attributes