Package jline.api.lqn

Class Lqn_export_nlp.Program

java.lang.Object
jline.api.lqn.Lqn_export_nlp.Program
Enclosing class:
Lqn_export_nlp

public static final class Lqn_export_nlp.Program extends Object
The program, built in memory. Field and method names follow the python script's; every array is in the program's own 0-based positions.
  • Field Details

    • HOSTS

      public final String[] HOSTS
    • HOST_MULT

      public final double[] HOST_MULT
    • HOST_MAXMULT

      public final double[] HOST_MAXMULT
    • HOST_INF

      public final boolean[] HOST_INF
    • TASKS

      public final String[] TASKS
    • TASK_HOST

      public final int[] TASK_HOST
    • TASK_MULT

      public final double[] TASK_MULT
    • TASK_INF

      public final boolean[] TASK_INF
    • TASK_ISREF

      public final boolean[] TASK_ISREF
    • TASK_THINK

      public final double[] TASK_THINK
    • ENTRIES

      public final String[] ENTRIES
    • ENTRY_TASK

      public final int[] ENTRY_TASK
    • ENTRY_ORDER

      public final int[] ENTRY_ORDER
    • ACTS

      public final String[] ACTS
    • ACT_TASK

      public final int[] ACT_TASK
    • ACT_ENTRY

      public final int[] ACT_ENTRY
    • ACT_DEMAND

      public final double[] ACT_DEMAND
    • ACT_VISITS

      public final double[] ACT_VISITS
    • CALLS

      public final String[] CALLS
    • CALL_ACT

      public final int[] CALL_ACT
    • CALL_ENTRY

      public final int[] CALL_ENTRY
    • CALL_MEAN

      public final double[] CALL_MEAN
    • CALL_CALLER_TASK

      public final int[] CALL_CALLER_TASK
    • FORK_ENTRY

      public final int[] FORK_ENTRY
    • FORK_BRANCHES

      public final int[][][] FORK_BRANCHES
    • FORK_LABEL

      public final String[] FORK_LABEL
    • SOFTMIN_ALPHA

      public final double SOFTMIN_ALPHA
    • HOST_LLD

      public final String[] HOST_LLD
    • TASK_LLD

      public final String[] TASK_LLD
    • HOST_RATE_CAPPED

      public final boolean[] HOST_RATE_CAPPED
    • HOST_RATE

      public final Lqn_export_nlp.Rate[] HOST_RATE
    • TASK_RATE

      public final Lqn_export_nlp.Rate[] TASK_RATE
    • NH

      public final int NH
    • NT

      public final int NT
    • NE

      public final int NE
    • NA

      public final int NA
    • NC

      public final int NC
    • NFORK

      public final int NFORK
    • NR

      public final int NR
    • NGH

      public final int NGH
    • NGT

      public final int NGT
    • NVAR

      public final int NVAR
    • NRES

      public final int NRES
    • ACTS_OF_HOST

      public final int[][] ACTS_OF_HOST
    • ACTS_OF_ENTRY

      public final int[][] ACTS_OF_ENTRY
    • CALLS_OF_ACT

      public final int[][] CALLS_OF_ACT
    • CALLS_INTO_ENTRY

      public final int[][] CALLS_INTO_ENTRY
    • CALLS_INTO_TASK

      public final int[][] CALLS_INTO_TASK
    • ENTRIES_OF_TASK

      public final int[][] ENTRIES_OF_TASK
    • FORK_ACTS

      public final boolean[] FORK_ACTS
    • BLOCKS_OF_ENTRY

      public final int[][] BLOCKS_OF_ENTRY
    • SEQ_ACTS_OF_ENTRY

      public final int[][] SEQ_ACTS_OF_ENTRY
    • REF_TASKS

      public final int[] REF_TASKS
    • REF_ENTRY

      public final int[] REF_ENTRY
    • TASK_DELAY

      public final boolean[] TASK_DELAY
    • HOST_DELAY

      public final boolean[] HOST_DELAY
    • TASK_POP

      public final double[] TASK_POP
    • SIBLING_ACTS

      public final int[][] SIBLING_ACTS
    • SIBLING_CALLS

      public final int[][] SIBLING_CALLS
    • QD_HOSTS

      public final int[] QD_HOSTS
    • QD_TASKS

      public final int[] QD_TASKS
    • GH_OF

      public final int[] GH_OF
      GH_OF[h], the position of host h among QD_HOSTS, -1 when it carries none.
    • GT_OF

      public final int[] GT_OF
    • HOST_NTOT

      public final double[] HOST_NTOT
    • TASK_NTOT

      public final double[] TASK_NTOT
    • HOST_DELTA

      public final double[] HOST_DELTA
    • TASK_DELTA

      public final double[] TASK_DELTA
    • BLOCK_NAMES

      public final String[] BLOCK_NAMES
      Variable blocks in layout order, with their sizes.
    • BLOCK_SIZES

      public final int[] BLOCK_SIZES
    • OFFSET

      public final Map<String,Integer> OFFSET
    • AEQ

      public final double[][] AEQ
    • BEQ

      public final double[] BEQ
    • AUB

      public final double[][] AUB
    • BUB

      public final double[] BUB
    • RES_LIN

      public final double[][] RES_LIN
    • RES_CONST

      public final double[] RES_CONST
    • hshift

      public final int hshift
      Position in the python layout of the model's element shifts, for the analyzer.
    • tshift

      public final int tshift
    • eshift

      public final int eshift
    • ashift

      public final int ashift
  • Method Details

    • col

      public int col(String block, int i)
      Absolute column of variable BLOCK at index I.
    • sent

      public int sent(int e)
      Column of the entry's thread-seconds: SA when the model forks, else S.
    • blockSize

      public int blockSize(String name)
      Size of variable block NAME.
    • block

      public double[] block(double[] x, String name)
      Variable block NAME of the iterate X.
    • varNames

      public List<String> varNames()
    • qbarHostTerms

      public List<double[]> qbarHostTerms(int h, int a, double g)
      g times the arrival-instant estimate at host H for activity A, as (column, coefficient) pairs.
    • qbarTaskTerms

      public List<double[]> qbarTaskTerms(int t, int c, double g)
    • residuals

      public double[] residuals(double[] x)
    • jacobian

      public double[][] jacobian(double[] x)
    • objective

      public double objective(double[] x)
    • qdPopHost

      public double qdPopHost(double[] Q, int h)
    • qdPopTask

      public double qdPopTask(double[] Qt, int t)
    • qbarHost

      public double qbarHost(double[] Q, int h, int a)
    • qbarTask

      public double qbarTask(double[] Qt, int t, int c)
    • initialPoint

      public double[] initialPoint(int warm)
      A point satisfying every linear relation, after WARM fixed-point sweeps of the QD-AMVA laws, python's initial_point.
    • polish

      public double[] polish(double[] x0, int iters)
      Newton on the square system [residuals; AEQ x - BEQ] = 0, each step the minimum-norm least-squares solution, python's polish.
    • polish

      public double[] polish(double[] x0)
    • solved

      public boolean solved(double[] x)
      A root of the square system, feasible to the bounds and the inequalities.
    • solve

      public Lqn_export_nlp.Result solve(int warm, int maxiter)
      Newton from an escalating warm start (WARM, then 5, 20 and 100 sweeps), python's solve; when no rung reaches a root, the projected Levenberg-Marquardt fallback from the best rung's start, then a polish.
    • merit

      public double merit(double[] x)
      The merit the fallback descends: residuals, equality and inequality violations squared.
    • lmFallback

      public Lqn_export_nlp.LmTrace lmFallback(double[] x0, int maxiter)
      Projected Levenberg-Marquardt on merit(double[]) over x >= 0, the fallback the MATLAB, JAR and C++ ports share in place of python's trust-constr.