linny-r 2.0.6 → 2.0.7

package/README.md

@@ -36,8 +36,8 @@ Linny-R is developed as a JavaScript package, and requires that **Node.js**
 is installed on your computer. This software can be downloaded from
 <a href="https://nodejs.org" target="_blank">https://nodejs.org</a>. 
 Make sure that you choose the correct installer for your computer.
-Linny-R is developed using the _current_ release. Presently (June 2024)
-this is 22.2.0. 
+Linny-R is developed using the _current_ release. Presently (December 2024)
+this is 23.3.0. 
 
 Run the installer and accept the default settings.
 There is <u>**no**</u> need to install the optional _Tools for Native Modules_.
@@ -48,7 +48,7 @@ Verify the installation by typing:
 
 ``node --version``
 
-The response should be the version number of Node.js, for example: v22.2.0.
+The response should be the version number of Node.js, for example: v23.3.0.
 
 ## Installing Linny-R
 It is advisable to install Linny-R in a directory on your computer, **not**
@@ -300,9 +300,9 @@ The Linny-R GUI should show in your browser window, while in the CLI you
 should see a long series of server log messages like:
 
 <pre>
-[2024-06-11 22:55:17] Static file: /index.html
-[2024-06-11 22:55:17] Static file: /scripts/iro.min.js
-[2024-06-11 22:55:17] Static file: /images/open.png
+[2024-12-01 22:55:17] Static file: /index.html
+[2024-12-01 22:55:17] Static file: /scripts/iro.min.js
+[2024-12-01 22:55:17] Static file: /images/open.png
 ... etc.
 </pre>
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "linny-r",
-  "version": "2.0.6",
+  "version": "2.0.7",
   "description": "Executable graphical language with WYSIWYG editor for MILP models",
   "main": "server.js",
   "scripts": {

package/static/linny-r.css

@@ -10,7 +10,7 @@ file that implements the graphical user interface for Linny-R.
 */
 
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -822,7 +822,7 @@ div.checked.not-same-not-changed {
 }
 
 #restore-dlg {
-  width: 440px;
+  width: 450px;
   max-height: 219px;
 }
 

package/static/scripts/linny-r-ctrl.js

@@ -875,9 +875,9 @@ class ChartManager {
 // CLASS SensitivityAnalysis provides the sensitivity analysis functionality
 class SensitivityAnalysis {
   constructor() {
-    // Initialize main dialog properties
+    // Initialize main dialog properties.
     this.reset();
-    // Sensitivity analysis creates & disposes an experiment and a chart
+    // Sensitivity analysis creates & disposes an experiment and a chart.
     this.experiment_title = '___SENSITIVITY_ANALYSIS___';
     this.chart_title = '___SENSITIVITY_ANALYSIS_CHART___';
   }
@@ -912,7 +912,7 @@ class SensitivityAnalysis {
     // a dummy chart is created that includes all these outcomes as *chart*
     // variables.
     if(!this.experiment) {
-      // Clear results from previous analysis
+      // Clear results from previous analysis.
       this.clearResults();
       this.parameters = [];
       for(let i = 0; i < MODEL.sensitivity_parameters.length; i++) {
@@ -924,7 +924,7 @@ class SensitivityAnalysis {
         if(oax) {
           this.parameters.push(oax);
         } else if(vn.length === 1 && obj instanceof Dataset) {
-          // Dataset without selector => push the dataset vector
+          // Dataset without selector => push the dataset vector.
           this.parameters.push(obj.vector);
         } else {
           UI.alert(`Parameter ${p} is not a dataset or expression`);
@@ -938,23 +938,24 @@ class SensitivityAnalysis {
       this.experiment = new Experiment(this.experiment_title);
       this.experiment.charts = [this.chart];
       this.experiment.inferVariables();
-      // This experiment always uses the same combination: the base selectors
+      // This experiment always uses the same combination: the base selectors.
       const bs = MODEL.base_case_selectors.split(' ');
       this.experiment.combinations = [];
-      // Add this combination N+1 times for N parameters
+      // Add this combination N+1 times for N parameters.
       for(let i = 0; i <= this.parameters.length; i++) {
         this.experiment.combinations.push(bs);
       }
-      // NOTE: model settings will not be changed, but nevertheless restored
+      // NOTE: Model settings will not be changed, but will be restored after
+      // each run => store the original settings.
       this.experiment.original_model_settings = MODEL.settingsString;
       this.experiment.original_round_sequence = MODEL.round_sequence;
     }
-    // Change the button (GUI only -- console will return FALSE)
+    // Change the button (GUI only -- console will return FALSE).
     const paused = this.resumeButtons();
     if(!paused) {
       this.experiment.time_started = new Date().getTime();
       this.experiment.active_combination_index = 0;
-      // NOTE: start with base case run, hence no active parameter yet
+      // NOTE: Start with base case run, hence no active parameter yet.
       MODEL.running_experiment = this.experiment;
     }
     // Let the experiment manager do the work!!
@@ -962,31 +963,31 @@ class SensitivityAnalysis {
   }
   
   processRestOfRun() {   
-    // This method is called by the experiment manager after an SA run
+    // This method is called by the experiment manager after a SA run.
     const x = MODEL.running_experiment;
     if(!x) return;
-    // Double-check that indeed the SA experiment is running 
+    // Double-check that indeed the SA experiment is running.
     if(x !== this.experiment) {
       UI.alert('ERROR: Expected SA experiment run, but got ' + x.title);
       return;
     } 
     const aci = x.active_combination_index;
-    // Always add solver messages
+    // Always add solver messages.
     x.runs[aci].addMessages();
-    // NOTE: use a "dummy experiment object" to ensure proper XML saving and
-    // loading , as the actual experiment is not stored
+    // NOTE: Use a "dummy experiment object" to ensure proper XML saving and
+    // loading , as the actual experiment is not stored.
     x.runs.experiment = {title: SENSITIVITY_ANALYSIS.experiment_title};
-    // Add run to the sensitivity analysis
+    // Add run to the sensitivity analysis.
     MODEL.sensitivity_runs.push(x.runs[aci]);
     this.showProgress('Run #' + aci);
-    // See if more runs should be done
+    // See if more runs should be done.
     const n = x.combinations.length;
     if(!VM.halted && aci < n - 1) {
       if(this.must_pause) {
         this.pausedButtons(aci);
         UI.setMessage('');
       } else {
-        // NOTE: use aci because run #0 is the base case w/o active parameter
+        // NOTE: Use aci because run #0 is the base case w/o active parameter.
         MODEL.active_sensitivity_parameter = this.parameters[aci];
         x.active_combination_index++;
         setTimeout(() => EXPERIMENT_MANAGER.runModel(), 5);
@@ -1001,31 +1002,31 @@ class SensitivityAnalysis {
       } else {
         this.showCheckmark(msecToTime(x.time_stopped - x.time_started));
       }
-      // No more runs => perform wrap-up
-      // Restore original model settings
+      // No more runs => perform wrap-up.
+      // (1) Restore original model settings.
       MODEL.running_experiment = null;
       MODEL.active_sensitivity_parameter = null;
       MODEL.parseSettings(x.original_model_settings);
       MODEL.round_sequence = x.original_round_sequence;
-      // Reset the Virtual Machine so t=0 at the status line,
-      // and ALL expressions are reset as well
+      // (2) Reset the Virtual Machine so t=0 at the status line, and ALL
+      // expressions are reset as well.
       VM.reset();
-      // Free the SA experiment and SA chart
+      // Free the SA experiment and SA chart.
       this.experiment = null;
       this.chart = null;
-      // Reset buttons (GUI only)
+      // Reset buttons (GUI only).
       this.readyButtons();
     }
     this.updateDialog();
-    // Reset the model, as results of last run will be showing still
+    // Reset the model, as results of last run will be showing still.
     UI.resetModel();
     CHART_MANAGER.resetChartVectors();
-    // NOTE: clear chart only when done (charts do not update during experiment)
+    // NOTE: Clear chart only when done (charts do not update during experiment).
     if(!MODEL.running_experiment) CHART_MANAGER.updateDialog();
   }
 
   stop() {
-    // Interrupt solver but retain data on server (and no resume)
+    // Interrupt solver but retain data on server (and no resume).
     VM.halt();
     this.readyButtons();
     this.showProgress('');
@@ -1033,13 +1034,13 @@ class SensitivityAnalysis {
   }
   
   clearResults() {
-    // Clear results and reset control buttons
+    // Clear results, and reset control buttons.
     MODEL.sensitivity_runs.length = 0;
     this.selected_run = -1;
   }
   
   computeData(sas) {
-    // Compute data value or status for statistic `sas`
+    // Compute data value or status for statistic `sas`.
     this.perc = {};
     this.shade = {};
     this.data = {};
@@ -1047,12 +1048,12 @@ class SensitivityAnalysis {
         ol = MODEL.sensitivity_outcomes.length,
         rl = MODEL.sensitivity_runs.length;
     if(ol === 0) return;
-    // Always find highest relative change
+    // Always find highest relative change.
     let max_dif = 0;
     for(let i = 0; i < ol; i++) {
       this.data[i] = [];
       for(let j = 0; j < rl; j++) {
-        // Get the selected statistic for each run to get an array of numbers
+        // Get the selected statistic for each run to get an array of numbers.
         const rr = MODEL.sensitivity_runs[j].results[i];
         if(!rr) {
           this.data[i].push(VM.UNDEFINED);
@@ -1076,7 +1077,7 @@ class SensitivityAnalysis {
           this.data[i].push(rr.last);
         }
       }
-      // Compute relative change
+      // Compute the relative change.
       let bsv = this.data[i][0];
       if(Math.abs(bsv) < VM.NEAR_ZERO) bsv = 0;
       this.perc[i] = [];
@@ -1097,26 +1098,26 @@ class SensitivityAnalysis {
         for(let j = 1; j < this.data[i].length; j++) this.perc[i].push('-');
       }
     }
-    // Now use max_dif to compute shades
+    // Now use max_dif to compute shades.
     for(let i = 0; i < ol; i++) {      
       this.shade[i] = [];
-      // Color scale range is -max ... +max (0 in center => white)
+      // Color scale range is -max ... +max (0 in center => white).
       for(let j = 0; j < this.perc[i].length; j++) {
         const p = this.perc[i][j];
         this.shade[i].push(p === VM.UNDEFINED || max_dif < VM.NEAR_ZERO ?
             0.5 : (p / max_dif + 1) / 2);
       }
-      // Convert to sig4Dig
+      // Convert to sig4Dig.
       for(let j = 0; j < this.data[i].length; j++) {
         this.data[i][j] = VM.sig4Dig(this.data[i][j]);
       }
-      // Format data such that they all have same number of decimals
+      // Format data such that they all have same number of decimals.
       if(this.relative_scale && this.perc[i][0] !== '-') {
         for(let j = 0; j < this.perc[i].length; j++) {
           this.perc[i][j] = VM.sig4Dig(this.perc[i][j]);
         }
         uniformDecimals(this.perc[i]);
-        // NOTE: only consider data of base scenario
+        // NOTE: Only consider data of base scenario.
         this.data[i][0] = VM.sig4Dig(this.data[i][0]);
       } else {
         uniformDecimals(this.data[i]);
@@ -1125,11 +1126,11 @@ class SensitivityAnalysis {
   }
   
   resumeButtons() {
-    // Console experiments cannot be paused, and hence not resumed
+    // Console experiments cannot be paused, and hence not resumed.
     return false;
   }
 
-  // Dummy methods: actions that are meaningful only for the graphical UI
+  // Dummy methods: actions that are meaningful only for the graphical UI.
   updateDialog() {}
   showCheckmark() {}
   showProgress() {}
@@ -1143,7 +1144,7 @@ class SensitivityAnalysis {
 // Class ExperimentManager controls the collection of experiments of the model
 class ExperimentManager {
   constructor() {
-    // NOTE: the properties below are relevant only for the GUI
+    // NOTE: The properties below are relevant only for the GUI.
     this.experiment_table = null;
     this.focal_table = null;
   }

package/static/scripts/linny-r-gui-constraint-editor.js

@@ -283,7 +283,8 @@ class ConstraintEditor {
           i = this.selected_point,
           pts = this.selected.points,
           li = pts.length - 1,
-          p = pts[this.selected_point],
+          // NOTE: Use a copy of the selected point, or it will not be updated.
+          p = pts[this.selected_point].slice(),
           minx = (i === 0 ? 0 : (i === li ? 100 : pts[i - 1][0])),
           maxx = (i === 0 ? 0 : (i === li ? 100 : pts[i + 1][0]));
       let cx = false,
@@ -317,6 +318,9 @@ class ConstraintEditor {
           p[1] = Math.round(3 * p[1]) / 3;
         }
       }
+      this.dragged_point = this.selected_point;
+      this.movePoint(p[0], p[1]);
+      this.dragged_point = -1;
       this.draw();
       this.updateEquation();
     }
@@ -670,7 +674,7 @@ class ConstraintEditor {
   }
 
   deleteSelector() {
-    // Delete modifier from selected dataset
+    // Delete modifier from selected dataset.
     if(!this.selected) return;
     const
         bl = this.selected,
@@ -1156,7 +1160,7 @@ class ConstraintEditor {
   }
 
   updateConstraint() {
-    // Updates the edited constraint, or adds a new constraint to the model
+    // Update the edited constraint, or add a new constraint to the model.
     // TO DO: prepare for undo
     if(this.edited_constraint === null) {
       this.edited_constraint = MODEL.addConstraint(this.from_node, this.to_node);

package/static/scripts/linny-r-gui-controller.js

@@ -13,7 +13,7 @@ handler functions.
 */
 
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -3673,7 +3673,7 @@ console.log('HERE name conflicts', name_conflicts, mapping);
       UI.notify('To diagnose unbounded problems, values beyond 1e+10 ' +
           'are considered as infinite (\u221E)');
     }
-    // Some changes may necessitate redrawing the diagram
+    // Some changes may necessitate redrawing the diagram.
     let cb = UI.boxChecked('settings-align-to-grid'),
         redraw = !model.align_to_grid && cb;
     model.align_to_grid = cb;
@@ -3688,7 +3688,7 @@ console.log('HERE name conflicts', name_conflicts, mapping);
     cb = UI.boxChecked('settings-block-arrows');
     redraw = redraw || cb !== model.show_block_arrows;
     model.show_block_arrows = cb;
-    // Changes affecting run length (hence vector lengths) require a model reset
+    // Changes affecting run length (hence vector lengths) require a model reset.
     let reset = false;
     reset = reset || (ts != model.time_scale);
     model.time_scale = ts;
@@ -4283,7 +4283,7 @@ console.log('HERE name conflicts', name_conflicts, mapping);
     const
         md = this.modals.link,
         l = this.edited_object;
-    // Check whether all input fields are valid
+    // Check whether all input fields are valid.
     if(!this.updateExpressionInput('link-R', 'rate', l.relative_rate)) {
       return false;
     }
@@ -4318,8 +4318,10 @@ console.log('HERE name conflicts', name_conflicts, mapping);
                 `</strong> will cause issues for ${VM.LM_SYMBOLS[m]} link`);
       }
     }
-    // NOTE: share of cost is input as a percentage, but stored as a floating
-    // point value between 0 and 1
+    // NOTE: Share of cost is input as a percentage, but stored as a floating
+    // point value between 0 and 1.
+    // If SoC is changed, *all* output links must be redrawn.
+    const soc_change = (l.share_of_cost !== soc / 100);
     l.share_of_cost = soc / 100;
     if(md.group.length > 1) {
       // NOTE: Special care must be taken to not set special multipliers
@@ -4330,10 +4332,15 @@ console.log('HERE name conflicts', name_conflicts, mapping);
       MODEL.focal_cluster.clearAllProcesses();
       UI.drawDiagram(MODEL);
     } else {
-      // Redraw the arrow shape that represents the edited link
-      this.paper.drawArrow(this.on_arrow);
-      // Redraw the FROM node if link has become (or no longer is) "first commit"
-      if(redraw) this.drawObject(this.on_arrow.from_node);
+      if(soc_change) {
+        // Redraw process with its links so that all SoC labels are updated.
+        this.on_arrow.from_node.drawWithLinks();
+      } else {
+        // Only redraw the arrow shape that represents the edited link.
+        this.paper.drawArrow(this.on_arrow);
+        // Redraw the FROM node if link has become (or no longer is) "first commit".
+        if(redraw) this.drawObject(this.on_arrow.from_node);
+      }
     }
     md.hide();
   }

package/static/scripts/linny-r-gui-model-autosaver.js

@@ -12,7 +12,7 @@ dialogs, the main drawing canvas, and event handler functions.
 */
 
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -165,7 +165,7 @@ class ModelAutoSaver {
       html += ['<tr class="dataset" style="color: gray" ',
           'onclick="FILE_MANAGER.loadAutoSavedModel(\'',
           m.name,'\');"><td class="restore-name">', m.name, '</td><td>',
-          m.date.substring(1, 16).replace('T', ' '),
+          m.date.substring(0, 16).replace('T', ' '),
           '</td><td style="text-align: right">',
           bytes[0], '</td><td>', bytes[1], '</td><td style="width:15px">',
           '<img class="del-asm-btn" src="images/delete.png" ',

package/static/scripts/linny-r-gui-monitor.js

@@ -11,7 +11,7 @@ for the Linny-R Monitor dialog.
 */
 
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

package/static/scripts/linny-r-gui-paper.js

@@ -11,7 +11,7 @@ functionality for the Linny-R model editor.
 */
 
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -909,16 +909,17 @@ class Paper {
   }
   
   //
-  // Diagram-drawing method draws the diagram for the focal cluster
+  // Diagram-drawing method draws the diagram for the focal cluster.
   //
   
   drawModel(mdl) {
-    // Draw the diagram for the focal cluster
+    // Draw the diagram for the focal cluster.
     this.clear();
-    // Prepare to draw all elements in the focal cluster
+    // Prepare to draw all elements in the focal cluster.
     const fc = mdl.focal_cluster;
     fc.categorizeEntities();
-    // NOTE: product positions must be updated before links are drawn
+    // NOTE: Product positions must be updated before links are drawn, so
+    // that links arrows will be drawn over their shapes.
     fc.positionProducts();
     for(let i = 0; i < fc.processes.length; i++) {
       fc.processes[i].clearHiddenIO();
@@ -926,10 +927,10 @@ class Paper {
     for(let i = 0; i < fc.sub_clusters.length; i++) {
       fc.sub_clusters[i].clearHiddenIO();
     }
-    // NOTE: also ensure that notes will update their fields
+    // NOTE: Also ensure that notes will update their fields.
     fc.resetNoteFields();
     // Draw link arrows and constraints first, as all other entities are
-    // slightly transparent so they cannot completely hide these lines
+    // slightly transparent so they cannot completely hide these lines.
     for(let i = 0; i < fc.arrows.length; i++) {
       this.drawArrow(fc.arrows[i]);
     }
@@ -945,25 +946,25 @@ class Paper {
     for(let i = 0; i < fc.sub_clusters.length; i++) {
       this.drawCluster(fc.sub_clusters[i]);
     }
-    // Draw notes last, as they are semi-transparent (and can be quite small)
+    // Draw notes last, as they are semi-transparent (and can be quite small).
     for(let i = 0; i < fc.notes.length; i++) {
       this.drawNote(fc.notes[i]);
     }
-    // Resize paper if necessary
+    // Resize paper if necessary.
     this.extend();
-    // Display model name in browser
+    // Display model name in browser.
     document.title = mdl.name || 'Linny-R';
   }
   
   drawSelection(mdl, dx=0, dy=0) {
     // NOTE: Clear this global, as Bezier curves move from under the cursor
-    // without a mouseout event 
+    // without a mouseout event.
     this.constraint_under_cursor = null;
-    // Draw the selected entities and associated links, and also constraints
+    // Draw the selected entities and associated links, and also constraints.
     for(let i = 0; i < mdl.selection.length; i++) {
       const obj = mdl.selection[i];
       // Links and constraints are drawn separately, so do not draw those
-      // contained in the selection 
+      // contained in the selection.
       if(!(obj instanceof Link || obj instanceof Constraint)) {
         if(obj instanceof Note) obj.parsed = false;
         UI.drawObject(obj, dx, dy);
@@ -972,12 +973,12 @@ class Paper {
     if(mdl.selection_related_arrows.length === 0) {
       mdl.selection_related_arrows = mdl.focal_cluster.selectedArrows();
     }
-    // Only draw the arrows that relate to the selection
+    // Only draw the arrows that relate to the selection.
     for(let i = 0; i < mdl.selection_related_arrows.length; i++) {
       this.drawArrow(mdl.selection_related_arrows[i]);
     }
     // As they typically are few, simply redraw all constraints that relate to
-    // the focal cluster
+    // the focal cluster.
     for(let i = 0; i < mdl.focal_cluster.related_constraints.length; i++) {
       this.drawConstraint(mdl.focal_cluster.related_constraints[i]);
     }
@@ -990,23 +991,23 @@ class Paper {
   //
 
   drawArrow(arrw, dx=0, dy=0) {
-    // Draws an arrow from FROM nodebox to TO nodebox
-    // NOTE: first erase previously drawn arrow
+    // Draw an arrow from FROM nodebox to TO nodebox.
+    // NOTE: First erase previously drawn arrow.
     arrw.shape.clear();
     arrw.hidden_nodes.length = 0;
-    // Use local variables so as not to change any "real" attribute values
+    // Use local variables so as not to change any "real" attribute values.
     let cnb, proc, prod, fnx, fny, fnw, fnh, tnx, tny, tnw, tnh,
         cp, rr, aa, bb, dd, nn, af, l, s, w, tw, th, bpx, bpy, epx, epy,
         sda, stroke_color, stroke_width, arrow_start, arrow_end,
         font_color, font_weight, luc = null, grid = null;
-    // Get the main arrow attributes
+    // Get the main arrow attributes.
     const
         from_nb = arrw.from_node,
         to_nb = arrw.to_node;
-    // Use "let" because `ignored` may also be set later on (for single link)
+    // Use "let" because `ignored` may also be set later on (for single link).
     let ignored = (from_nb && MODEL.ignored_entities[from_nb.identifier]) ||
         (to_nb && MODEL.ignored_entities[to_nb.identifier]);
-    // First check if this is a block arrow (ONE node being null)
+    // First check if this is a block arrow (ONE node being null).
     if(!from_nb) {
       cnb = to_nb;
     } else if(!to_nb) {
@@ -1014,22 +1015,22 @@ class Paper {
     } else {
       cnb = null;
     }
-    // If not NULL `cnb` is the cluster or node box (product or process) having
+    // If not NULL, `cnb` is the cluster or node box (product or process) having
     // links to entities outside the focal cluster. Such links are summarized
     // by "block arrows": on the left edge of the box to indicate inflows,
     // on the right edge to indicate outflows, and two-headed on the top edge
     // to indicate two-way flows. When the cursor is moved over a block arrow,
     // the Documentation dialog will display the list of associated nodes
-    // (with their actual flows if non-zero)
+    // (with their actual flows if non-zero).
     if(cnb) {
-      // Distinguish between input, output and io products
+      // Distinguish between input, output and io products.
       let ip = [], op = [], iop = [];
       if(cnb instanceof Cluster) {
         for(let i = 0; i < arrw.links.length; i++) {
           const lnk = arrw.links[i];
-          // determine which product is involved
+          // Determine which product is involved.
           prod = (lnk.from_node instanceof Product ? lnk.from_node : lnk.to_node);
-          // NOTE: clusters "know" their input/output products
+          // NOTE: Clusters "know" their input/output products.
           if(cnb.io_products.indexOf(prod) >= 0) {
             addDistinct(prod, iop);
           } else if(cnb.consumed_products.indexOf(prod) >= 0) {
@@ -1039,7 +1040,7 @@ class Paper {
           }
         }
       } else {
-        // cnb is process or product => knows its inputs and outputs
+        // `cnb` is process or product => knows its inputs and outputs.
         for(let i = 0; i < arrw.links.length; i++) {
           const lnk = arrw.links[i];
           if(lnk.from_node === cnb) {
@@ -1047,7 +1048,7 @@ class Paper {
           } else {
             addDistinct(lnk.from_node, ip);
           }
-          // NOTE: for processes, products cannot be BOTH input and output
+          // NOTE: For processes, products cannot be BOTH input and output.
         }
       }
       cnb.hidden_inputs = ip;

package/static/scripts/linny-r-model.js

@@ -10,7 +10,7 @@ the Linny-R project.
 */
 
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -5801,7 +5801,7 @@ class NodeBox extends ObjectWithXYWH {
   }
   
   resize() {
-    // Resizes this node; returns TRUE iff size has changed.
+    // Resize this node; returns TRUE iff size has changed.
     // Therefore, keep track of original width and height.
     const
         ow = this.width,
@@ -5814,7 +5814,7 @@ class NodeBox extends ObjectWithXYWH {
       w = Math.max(w, UI.textSize(`[${this.scale_unit}]`).width);
     }
     this.frame_width = w + 7;
-    // Add 17 pixels height for actor name
+    // Add 17 pixels height for actor name.
     this.height = Math.max(50, this.bbox.height + 17);
     if(this instanceof Process) {
       this.width = Math.max(90, this.frame_width + 20);
@@ -5822,11 +5822,11 @@ class NodeBox extends ObjectWithXYWH {
     } else if(this instanceof Cluster) {
       this.width = Math.max(
           CONFIGURATION.min_cluster_size, this.frame_width + 20);
-      // Clusters have a square shape
+      // Clusters have a square shape.
       this.height = Math.max(this.width, this.height); 
     } else {
       this.height += 8;
-      // Reserve some extra space for UB/LB if defined
+      // Reserve some extra space for UB/LB if defined.
       if(this.lower_bound.defined || this.upper_bound.defined) {
         this.frame_width += 16;
       }
@@ -8282,20 +8282,20 @@ class Product extends Node {
     // By default, processes have the letter p, products the letter q.
     this.TEX_id = 'p';
     // For products, the default bounds are [0, 0], and modeler-defined bounds
-    // typically are equal
+    // typically are equal.
     this.equal_bounds = true;
-    // In addition to LB, UB and IL, products has 1 input attribute: P
+    // In addition to LB, UB and IL, products has 1 input attribute: P.
     this.price = new Expression(this, 'P', '');
-    // Products have a highest cost price, and may have a stock price (if storage)
+    // Products have a highest cost price, and may have a stock price (if storage).
     this.highest_cost_price = [];
     this.stock_price = [];
     // Stock level changing from 0 to positive counts as "start up", while
-    // changing from positive to 0 counts as a "shut-down"
-    // NOTE: being relatively rare, start_ups and shut_downs are not vectors,
-    // but store the numbers of the time steps in which they occurred
+    // changing from positive to 0 counts as a "shut-down".
+    // NOTE: Being relatively rare, start_ups and shut_downs are not vectors,
+    // but store the numbers of the time steps in which they occurred.
     this.start_ups = [];
     this.shut_downs = [];
-    // Modeler may set explicit properties
+    // Modeler may set explicit properties.
     this.is_source = false;
     this.is_sink = false;
     this.is_buffer = false;
@@ -8650,13 +8650,13 @@ class Product extends Node {
   }
 
   get defaultAttribute() {
-    // Products have their level as default attribute 
+    // Products have their level as default attribute.
     return 'L';
   }
 
   attributeValue(a) {
-    // Returns the computed result for attribute `a`
-    // (for products, this is always a vector except IL)
+    // Return the computed result for attribute `a`.
+    // NOTE: For products, this is always a vector except IL.
     if(a === 'L') return this.level;
     if(a === 'CP') return this.cost_price;
     if(a === 'HCP') return this.highest_cost_price;
@@ -8664,7 +8664,7 @@ class Product extends Node {
   }
 
   attributeExpression(a) {
-    // Products have four expression attributes
+    // Products have four expression attributes.
     if(a === 'LB') return this.lower_bound;
     if(a === 'UB') {
       return (this.equal_bounds ? this.lower_bound : this.upper_bound);
@@ -8748,7 +8748,7 @@ class Product extends Node {
   }
 
   copyPropertiesFrom(p) {
-    // Set properties to be identical to those of product `p`
+    // Set properties to be identical to those of product `p`.
     this.x = p.x;
     this.y = p.y;
     this.comments = p.comments;
@@ -8765,11 +8765,11 @@ class Product extends Node {
     this.initial_level.text = p.initial_level.text;
     this.integer_level = p.integer_level;
     this.TEX_id = p.TEX_id;
-    // NOTE: do not copy the `no_links` property, nor the import/export status
+    // NOTE: Do not copy the `no_links` property, nor the import/export status.
   }
 
   differences(p) {
-    // Return "dictionary" of differences, or NULL if none
+    // Return "dictionary" of differences, or NULL if none.
     const d = differences(this, p, UI.MC.PRODUCT_PROPS);
     if(Object.keys(d).length > 0) return d;
     return null;
@@ -12699,6 +12699,10 @@ class BoundLine {
         VM.constraint_codes[this.type] + '] bound line #' +
         this.constraint.bound_lines.indexOf(this);
   }
+  
+  get name() {
+    return this.displayName;
+  }
 
   get copy() {
     // Return a "clone" of this bound line.

package/static/scripts/linny-r-utils.js

@@ -9,7 +9,7 @@ This JavaScript file (linny-r-utils.js) defines a variety of "helper" functions
 that are used in other Linny-R modules.
 */
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -74,16 +74,16 @@ function safeStrToFloat(str, val=0) {
 }
 
 function safeStrToInt(str, val=0) {
-  // Returns numeric value of integer string, IGNORING decimals after
+  // Return numeric value of integer string, IGNORING decimals after
   // point or comma.
-  // NOTE: returns default value `val` if `str` is empty, null or undefined
+  // NOTE: Return default value `val` if `str` is empty, null or undefined.
   const n = (str ? parseInt(str) : val);
   return (isNaN(n) ? val : n);
 }
 
 function rangeToList(str, max=0) {
-  // Parses ranges "n-m/i" into a list of integers
-  // Returns FALSE if range is not valid according to the convention below
+  // Parse ranges "n-m/i" into a list of integers
+  // Return FALSE if range is not valid according to the convention below
   // The part "/i" is optional and denotes the increment; by default, i = 1.
   // The returned list will contain all integers starting at n and up to
   // at most (!) m, with increments of i, so [n, n+i, n+2i, ...]
@@ -112,6 +112,33 @@ function rangeToList(str, max=0) {
   return list;
 }
 
+function listToRange(list) {
+  // Return a string that represents the given list of integers as a series
+  // of subranges, e.g., [0,1,2,3,5,6,9,11] results in "0-3, 5-6, 9, 11".
+  const
+      n = list.length,
+      subs = [];
+  if(!n) return '';
+  let i = 0,
+      from = list[0],
+      to = from;
+  while(i < n) {
+    i++;
+    if(list[i] === to + 1) {
+      to++;
+    } else {
+      if(from === to) {
+        subs.push(from);
+      } else {
+        subs.push(`${from}-${to}`);
+      }
+      from = list[i];
+      to = from;
+    }
+  }
+  return subs.join(', ');
+}
+
 function dateToString(d) {
   // Returns date-time `d` in UTC format, accounting for time zone
   const offset = d.getTimezoneOffset();
@@ -1098,6 +1125,7 @@ if(NODE) module.exports = {
   safeStrToFloat: safeStrToFloat,
   safeStrToInt: safeStrToInt,
   rangeToList: rangeToList,
+  listToRange: listToRange,
   dateToString: dateToString,
   msecToTime: msecToTime,
   compactClockTime: compactClockTime,

package/static/scripts/linny-r-vm.js

@@ -12,7 +12,7 @@ executed by the VM, construct the Simplex tableau that can be sent to the
 MILP solver.
 */
 /*
-Copyright (c) 2017-2024 Delft University of Technology
+Copyright (c) 2017-2025 Delft University of Technology
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -444,17 +444,21 @@ class Expression {
     // expression).
     if(t < 0 || this.isStatic) t = 0;
     if(t >= v.length) return VM.UNDEFINED;
-    // NOTE: When VM is setting up a tableau, values computed for the
-    // look-ahead period must be recomputed.
-    if(v[t] === VM.NOT_COMPUTED || v[t] === VM.COMPUTING ||
+    // NOTES:
+    // (1) When VM is setting up a tableau, values computed for the
+    //     look-ahead period must be recomputed.
+    // (2) Always recompute value for sensitivity analysis parameter, as
+    //     otherwise the vector value will be scaled cumulatively.
+    const sap = (this === MODEL.active_sensitivity_parameter);
+    if(sap || v[t] === VM.NOT_COMPUTED || v[t] === VM.COMPUTING ||
       (!this.isStatic && VM.inLookAhead(t))) {
       v[t] = VM.NOT_COMPUTED;
       this.compute(t, number);
     }
-    // NOTE: when this expression is the "active" parameter for sensitivity
-    // analysis, the result is multiplied by 1 + delta %
-    if(this === MODEL.active_sensitivity_parameter) {
-      // NOTE: do NOT scale exceptional values
+    // NOTE: When this expression is the "active" parameter for sensitivity
+    // analysis, the result is multiplied by 1 + delta %.
+    if(sap) {
+      // NOTE: Do NOT scale exceptional values.
       if(v[t] > VM.MINUS_INFINITY && v[t] < VM.PLUS_INFINITY) {
         v[t] *= (1 + MODEL.sensitivity_delta * 0.01);
       }
@@ -1849,14 +1853,14 @@ class ExpressionParser {
       if(this.then_stack.length < 1) {
         this.error = 'Unexpected :';
       } else {
-        // Similar to above: when a : operator is "coded", the ELSE part
+        // Similar to above: When a : operator is "coded", the ELSE part
         // has been coded, so the end of the code array is the target for
-        // the most recently added JUMP
+        // the most recently added JUMP.
         this.code[this.then_stack.pop()][1] = this.code.length;
       }
     } else {
       // All other operations require VM instructions that operate on the
-      // expression stack
+      // expression stack.
       this.code.push([op, null]);
       if(op === VMI_concat) {
         this.concatenating = true;
@@ -1864,8 +1868,8 @@ class ExpressionParser {
         const randcode = RANDOM_CODES.indexOf(op) >= 0;
         if(REDUCING_CODES.indexOf(op) >= 0) {
           if(randcode && !this.concatenating) {
-            // NOTE: probability distributions MUST have a parameter list but
-            // MIN and MAX will also accept a single argument
+            // NOTE: Probability distributions MUST have a parameter list but
+            // MIN and MAX will also accept a single argument.
             console.log('OPERATOR:', op);
             this.error = 'Missing parameter list';
           }
@@ -2120,6 +2124,8 @@ class VirtualMachine {
     this.numeric_issue = '';
     // Warnings are stored in a list to permit browsing through them.
     this.issue_list = [];
+    // Bound issues (UB < LB) are recorded to permit compact warnings.
+    this.bound_issues = {};
     // The call stack tracks evaluation of "nested" expression variables.
     this.call_stack = [];
     this.block_count = 0;
@@ -2468,6 +2474,8 @@ class VirtualMachine {
     // block).
     this.error_count = 0;
     this.block_issues = 0;
+    // Clear bound issue dictionary.
+    this.bound_issues = {};
     // Clear issue list with warnings and hide issue panel.
     this.issue_list.length = 0;
     this.issue_index = -1;
@@ -2581,6 +2589,7 @@ class VirtualMachine {
     // Return number `n` formatted so as to show 2-3 significant digits
     // NOTE: as `n` should be a number, a warning sign will typically
     // indicate a bug in the software.
+    if(typeof n === 'string') n = parseFloat(n);
     if(n === undefined || isNaN(n)) return '\u26A0'; // Warning sign
     const sv = this.specialValue(n);
     // If `n` has a special value, return its representation.
@@ -2608,6 +2617,7 @@ class VirtualMachine {
     // Return number `n` formatted so as to show 4-5 significant digits.
     // NOTE: As `n` should be a number, a warning sign will typically
     // indicate a bug in the software.
+    if(typeof n === 'string') n = parseFloat(n);
     if(n === undefined || isNaN(n)) return '\u26A0';
     const sv = this.specialValue(n); 
     // If `n` has a special value, return its representation.
@@ -3204,8 +3214,8 @@ class VirtualMachine {
   
   setBoundConstraints(p) {
     // Set LB and UB constraints for product `p`.
-    // NOTE: This method affects the VM coefficient vector, so save it
-    // (if needed) before calling this method.
+    // NOTE: This method affects the VM coefficient vector, so this vector
+    // should be saved (using a VM instruction) if it is needed later.
     const
         vi = p.level_var_index,
         lesvi = p.stock_LE_slack_var_index,
@@ -4338,7 +4348,7 @@ class VirtualMachine {
                     ' will compromise computation of its binary variables';
                 UI.warn(msg);
                 this.logMessage(this.block_count,
-                    'WARNING: ' + msg.replace(/<\/?strong>/g, '"'));
+                    this.WARNING + msg.replace(/<\/?strong>/g, '"'));
               }
             }
             if(hub !== ub) {
@@ -4620,8 +4630,8 @@ class VirtualMachine {
             high_rate) + 1);
     if(this.slack_penalty > VM.MAX_SLACK_PENALTY) {
       this.slack_penalty = VM.MAX_SLACK_PENALTY;
-      this.logMessage(this.block_count,
-        'WARNING: Max. slack penalty reached; try to scale down your model coefficients');
+      this.logMessage(this.block_count, this.WARNING +
+          'Max. slack penalty reached; try to scale down your model coefficients');
     }
     const m = Math.max(
         Math.abs(this.low_coefficient), Math.abs(this.high_coefficient));
@@ -5696,7 +5706,6 @@ class VirtualMachine {
             return ` +${c} ${v}`; // Prefix coefficient with +
             // NOTE: This may return  +0 X001.
           };
-
     this.numeric_issue = '';
     // First add the objective (always MAXimize).
     if(cplex) {
@@ -6160,7 +6169,9 @@ class VirtualMachine {
   }
 
   stopSolving() {
+    // Wrap-up after solving is completed or aborted.    
     this.stopTimer();
+    // Stop rotating the Linny-R icon, and update buttons.
     UI.stopSolving();
   }
   
@@ -6312,7 +6323,7 @@ Solver status = ${json.status}`);
     }
     // If negative delays require "fixating" variables for some number
     // of time steps, this must be logged in the monitor.
-    const keys = Object.keys(this.variables_to_fixate);
+    let keys = Object.keys(this.variables_to_fixate);
     if(keys.length) {
       const msg = ['NOTE: Due to negative link delays, levels for ' +
             pluralS(keys.length, 'variable') + ' are pre-set:'];
@@ -6341,6 +6352,27 @@ Solver status = ${json.status}`);
       }
       this.logMessage(this.block_count, msg.join('\n'));
     }
+    // Convert bound issues to warnings in the Monitor.
+    keys = Object.keys(this.bound_issues).sort();
+    const n = keys.length;
+    if(n) {
+      let vlist = '',
+          first = 1e20;
+      for(let i = 0; i < n; i++) {
+        const
+            k = keys[i],
+            bit = this.bound_issues[k];
+        vlist += `\n   - ${k} (t=${listToRange(bit)})`;
+        first = Math.min(first, bit[0]);
+      }
+      const msg = `Lower bound exceeds upper bound for ${n} processes`;
+      this.logMessage(this.block_count,
+          `${this.WARNING}(t=${first}) ${msg}:${vlist}`);
+      UI.warn(msg + ' - check Monitor for details');
+      // Clear bound issue dictionary, so next block starts anew.
+      this.bound_issues = {};
+    }
+    // Create the input file for the solver.
     this.logMessage(this.block_count,
         'Creating model for block #' + this.blockWithRound);
     this.cbl = CONFIGURATION.progress_needle_interval * 200;
@@ -7581,6 +7613,108 @@ function VMI_ge(x) {
   }
 }
 
+function VMI_at(x) {
+  // Pop the top number on the stack, and use its integer part as index i
+  // to replace the new top element (which must be a dataset or a grouping)
+  // by its i-th element.
+  let d = x.pop();
+  if(d !== false) {
+    if(DEBUGGING) console.log('AT (' + d.join(', ') + ')');
+    let a,
+        from = false,
+        to = false,
+        step = 1,
+        group = false,
+        period = false,
+        range = [],
+        ok = true;
+    // Check whether the first argument (d[0]) is indexable.
+    if(d[0] instanceof Array) {
+      a = d[0];
+      group = true;
+    } else if(d[0].entity instanceof Dataset) {
+      a = d[0].entity.vector;
+      period = d[0].periodic;
+    } else {
+      x.retop(VM.ARRAY_INDEX);
+      return;
+    }
+    // Check whether the second argument (d[1]) is a number or a pair.
+    if(d[1] instanceof Array) {
+      if(d[1].length > 3 || typeof d[1][0] !== 'number') {
+        ok = false;
+      } else if(d[1].length === 3) {
+        // Optional third index argument is range index increment.
+        if(typeof d[1][2] === 'number') {
+          step = Math.floor(d[1][2]);
+          // Ignore increment if it truncates to zero.
+          if(!step) step = 1;
+          // Get the range end.
+          if(typeof d[1][1] === 'number') {
+            to = Math.floor(d[1][1]);
+          } else {
+            ok = false;
+          }
+        } else {
+          ok = false;
+        }
+      } else if(d[1].length === 2) {
+        // Optional second argument is range index end.
+        if(typeof d[1][1] === 'number') {
+          to = Math.floor(d[1][1]);
+        } else {
+          ok = false;
+        }
+      }
+      if(ok) {
+        from = Math.floor(d[1][0]);
+        // Groupings are 0-based arrays but indexed as 1-based.
+        if(group) {
+          from--;
+          to--;
+        }
+        // Check whether from, to and step are feasible.
+        if(to !== false) {
+          if(to <= from && step < 0) {
+            for(let i = from; i >= to; i += step) range.push(i);
+          } else if(to >= from && step > 0) {
+            for(let i = from; i <= to; i += step) range.push(i);
+          } else {
+            ok = false;
+          }
+        }
+      }
+    }
+    if(ok && !range.length && typeof d[1] === 'number') {
+      range = [Math.floor(d[1]) - (group ? 1 : 0)];
+    } else if(!range.length) {
+      ok = false;
+    }
+    if(!ok) {
+      x.retop(VM.ARRAY_INDEX);
+      return;
+    }
+    const
+        n = range.length,
+        r = [];
+    for(let i = 0; i < n; i++) {
+      const index = range[i];
+      if(index < 0) {
+        r.push(VM.UNDEFINED);
+      } else if(period) {
+        r.push(a[index % a.length]);
+      } else {
+        r.push(a[index]);
+      }
+    }
+    if(n === 1) {
+      x.retop(r[0]);
+    } else {
+      x.retop(r);
+    }
+  }
+}
+
 function VMI_add(x) {
   // Pop the top number on the stack, and add it to the new top number.
   const d = x.pop();
@@ -8217,6 +8351,13 @@ function VMI_set_bounds(args) {
     console.log(['set_bounds [', k, '] ', vbl.displayName, '[',
       VM.variables[vi - 1][0],'] t = ', VM.t, ' LB = ', VM.sig4Dig(l),
       ', UB = ', VM.sig4Dig(u), fixed].join(''), l, u, inf_val);
+  } else if(u < l) {
+    // Warn that "impossible" bounds would have been set...
+    const vk = vbl.displayName;
+    if(!VM.bound_issues[vk]) VM.bound_issues[vk] = [];
+    VM.bound_issues[vk].push(VM.t);
+    // ... and set LB to UB, so that lowest value is bounding.
+    l = u;
   }
   // NOTE: Since the VM vectors for lower bounds and upper bounds are
   // initialized with default values (0 for LB, +INF for UB), the bounds
@@ -9270,7 +9411,7 @@ function VMI_add_available_capacity(link) {
 const
   // Valid symbols in expressions
   PARENTHESES = '()',
-  OPERATOR_CHARS = ';?:+-*/%=!<>^|',
+  OPERATOR_CHARS = ';?:+-*/%=!<>^|@',
   // Opening bracket, space and single quote indicate a separation
   SEPARATOR_CHARS = PARENTHESES + OPERATOR_CHARS + "[ '",
   COMPOUND_OPERATORS = ['!=', '<>', '>=', '<='],
@@ -9302,13 +9443,13 @@ const
       VMI_weibull, VMI_npv],
   DYADIC_OPERATORS = [
       ';', '?', ':', 'or', 'and',
-      '=', '<>', '!=',
-      '>', '<', '>=', '<=', '+', '-', '*', '/',
+      '=', '<>', '!=', '>', '<', '>=', '<=',
+      '@', '+', '-', '*', '/',
       '%', '^', 'log', '|'],
   DYADIC_CODES = [
       VMI_concat, VMI_if_then, VMI_if_else, VMI_or, VMI_and,
       VMI_eq, VMI_ne, VMI_ne, VMI_gt, VMI_lt, VMI_ge, VMI_le,
-      VMI_add, VMI_sub, VMI_mul, VMI_div, VMI_mod,
+      VMI_at, VMI_add, VMI_sub, VMI_mul, VMI_div, VMI_mod,
       VMI_power, VMI_log, VMI_replace_undefined],
 
   // Compiler checks for random codes as they make an expression dynamic
@@ -9316,7 +9457,7 @@ const
       VMI_triangular, VMI_weibull],
   
   // Compiler checks for reducing codes to unset its "concatenating" flag
-  REDUCING_CODES = [VMI_min, VMI_max, VMI_binomial, VMI_normal,
+  REDUCING_CODES = [VMI_at, VMI_min, VMI_max, VMI_binomial, VMI_normal,
       VMI_triangular, VMI_weibull, VMI_npv],
   
   // Custom operators may make an expression level-based
@@ -9324,7 +9465,7 @@ const
   
   OPERATORS = DYADIC_OPERATORS.concat(MONADIC_OPERATORS), 
   OPERATOR_CODES = DYADIC_CODES.concat(MONADIC_CODES),
-  PRIORITIES = [1, 2, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 10,
+  PRIORITIES = [1, 2, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5.5, 6, 6, 7, 7, 7, 8, 8, 10,
       9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9],
   ACTUAL_SYMBOLS = CONSTANT_SYMBOLS.concat(OPERATORS),
   SYMBOL_CODES = CONSTANT_CODES.concat(OPERATOR_CODES);