Modeling to Generate Alternatives

Updated 5 January 2026

Modeling to Generate Alternatives (MGA) is a family of mathematical and algorithmic methods that explore near-optimal solutions to reveal diverse decision options.
MGA employs techniques like Hop-Skip-Jump, random direction sampling, and MILP solution pooling to systematically map the feasible design space.
MGA enhances decision support by addressing uncertainty and enabling stakeholder engagement through quantitatively informed scenario analysis.

Modeling to Generate Alternatives (MGA) refers to a family of mathematical programming and algorithmic techniques designed to characterize, enumerate, and analyze the set of alternative solutions to optimization problems—particularly those alternative solutions that are near-optimal with respect to an original objective. Beyond returning a single “best” solution, MGA systematically explores the structure of the near-optimal feasible region, generating a diverse ensemble of configurations that may differ substantially in decision variables, system structure, or policy implications. MGA is now a critical methodology for robust decision-making across domains including energy systems, transportation choice modeling, power grid operation, public-sector budgeting, and machine learning (DeCarolis et al., 2019, Lau et al., 2024, Lombardi et al., 2022, Lau et al., 2024, Kchaou et al., 29 Dec 2025, Ghasemi, 2015, Lau et al., 29 Oct 2025, Funke et al., 2024, Viens et al., 11 Nov 2025, Schricker et al., 2023, Yao et al., 2021).

1. Formal Foundations and Theoretical Perspective

At its core, MGA is grounded in the mathematical programming perspective that views not just a single optimal solution but the entire ε-neighborhood of the optimal cost or value as the relevant design space. Given an optimization problem

$z^* = \min_{x \in X} f(x),$

the set of all “alternatives” within tolerance $\mu$ is

$S(\mu) = \{x \in X \mid f(x) \leq z^* + \mu\}.$

For linear and convex problems, $S(\mu)$ forms a convex (often polyhedral) sublevel set whose vertices fully describe all possible extreme alternative solutions. MGA is the systematic generation or exploration of (a) the structure (vertices, facets, projection) of $S(\mu)$ ; (b) representative or extreme points thereof; and (c) sometimes dense or continuous samples from the interior region (Viens et al., 11 Nov 2025, Lau et al., 2024, Lau et al., 2024, Kchaou et al., 29 Dec 2025). In mixed-integer and nonlinear settings, the enumeration focuses on integer-feasible or projectively meaningful alternatives, often leveraging MILP solution-pool techniques or recursive enumeration algorithms (Schricker et al., 2023, Lau et al., 29 Oct 2025).

The rationale for this focus is twofold: (1) near-optimal solutions capture practical flexibility, robustness, and diversity that is usually invisible in single-solution reporting; and (2) structural or policy constraints, unmodeled uncertainties, or stakeholder preferences can often be satisfied without violating the near-optimality slack.

2. Canonical Problem Formulations and Algorithmic Workflows

MGA is most commonly applied to large-scale convex or linear programs, especially in capacity expansion, transportation, and resource allocation contexts. The canonical MGA formulation introduces a budget-slack constraint around an incumbent optimal solution and re-optimizes with varied secondary objectives:

Given optimal $(x^*, y^*)$ , define $\epsilon > 0$ (relative or absolute slack).
The near-optimal feasible region is

$\mathcal{F}_\epsilon = \{ x \in X \mid f(x) \leq (1+\epsilon) f(x^*) \}$

MGA then solves a series of auxiliary problems:

$\min_{x \in \mathcal{F}_\epsilon} w^\top x$

for a systematic family of “exploratory” weight vectors $w$ tuned to sample extremes, faces, axes, or random directions within $\mathcal{F}_\epsilon$ (Lau et al., 2024, Kchaou et al., 29 Dec 2025, Funke et al., 2024, Lau et al., 2024).

Several canonical workflows exist:

Hop-Skip-Jump (HSJ): Sequentially penalizes previously used variables, pushing toward sparsity and diversity in selected technologies (Lau et al., 2024, DeCarolis et al., 2019).
Random Vector/Direction: Samples random weight vectors for parallel or exhaustive boundary coverage; highly parallelizable (Lau et al., 2024, Funke et al., 2024).
Capacity Min/Max and Axis Bridging: Maximizes or minimizes specific variables or subsets to find axis-extreme alternatives (Kchaou et al., 29 Dec 2025, Lau et al., 2024).
Modeling All Alternatives (MAA): Constructs the full convex hull of solution extremes (for small to moderate dimension), then decomposes and samples interior points via convex combinatorics (Kchaou et al., 29 Dec 2025, Schricker et al., 2023, Lau et al., 2024).
MILP Solution Pool and No-Good Cuts: For integer variables, enumerate all feasible alternatives within slack, adding no-good constraints to prevent duplicates (Viens et al., 11 Nov 2025, Schricker et al., 2023, Lau et al., 29 Oct 2025).

Algorithmic advancements include multi-objective simplex (Funplex) to reduce redundant computation in large-scale LPs (Funke et al., 2024), and parallelized Benders/cutting-plane methods for decomposing MGA problems across temporal or spatial subproblems (Lau et al., 29 Oct 2025).

3. Application Domains and Instantiations

Energy Systems Planning

MGA is extensively applied to capacity-expansion, decarbonization, and transmission expansion models (Lau et al., 2024, Kchaou et al., 29 Dec 2025, Lau et al., 29 Oct 2025, Lombardi et al., 2022, DeCarolis et al., 2019). Systems are modeled via large LPs or MILPs over capacity, dispatch, and storage variables. MGA techniques expose (i) flexibility in technology-selection (e.g., which renewables are essential vs. fungible), (ii) spatial and temporal diversity (e.g., new options for fairer infrastructure siting), and (iii) robust portfolios under uncertainty.

MGA in these contexts typically operates as follows:

Define slack ( $\varepsilon$ ): 5–15% is typical; e.g., “all portfolios within 10% of the minimum cost.”
Select variables of interest ( $n$ ): Capacity allocation, site decisions, etc.
Generate objectives ( $v$ ): Random, axis, or Pareto directions.
Parallelize boundary solves: Modern implementations now solve 10s–1000s of alternatives in parallel (Lau et al., 2024, Funke et al., 2024, Lau et al., 29 Oct 2025).
Post-processing: Cluster, visualize, or rule-extract (via interpretable-ML) to summarize the high-dimensional solution space and provide archetypes to stakeholders (Kchaou et al., 29 Dec 2025).

Electricity Network Reconfiguration

In transmission reconfiguration, MGA targets mixed-integer DC-OPF (optimal power flow) or network topology problems, generating a diverse set of near-optimal switching strategies that are then filtered for operational feasibility (e.g., AC-OPF checks) (Crozier, 23 Oct 2025, Bannmüller et al., 22 Sep 2025). Human-in-the-loop approaches iteratively adjust weight vectors to reflect operator feedback, using diversity metrics to select topologically distinct and practical solutions (Bannmüller et al., 22 Sep 2025).

Transportation and Discrete Choice

In discrete choice modeling, MGA is used for generating feasible and relevant choice-sets for agents, particularly in mode- or route-choice estimation. Explicitly enforcing availability constraints and generating individualized alternative sets using real-time APIs or learned generative models improves both statistical fit and behavioral realism (Ghasemi, 2015, Yao et al., 2021). The result can be a substantial increase in likelihood-ratio index and stability of estimated preference parameters.

Feature Selection and Hypothesis Generation

In statistics and machine learning, MGA principles underlie algorithms for alternative feature-set selection (e.g., diverse sparse regressors) or generating multiple plausible hypotheses in supervised learning (Bach, 2023, Peng et al., 2020, Tang et al., 2023). These approaches typically add dissimilarity constraints (e.g., Dice distance for feature sets) or contrastive losses to force diversity among near-optimal solutions or predictions.

4. Computational Strategies and Recent Innovations

Several computational challenges arise with MGA, especially in large-scale or mixed-integer settings:

Scalability: Classical MGA requires solving $O(10^2-10^4)$ large-scale LPs or MILPs. Multi-objective simplex (Funplex) drastically reduces redundant pivoting, providing up to $5-8\times$ speed-up over naive parallelization in LP contexts (Funke et al., 2024).
Benders/Cutting-plane Decomposition: Decompose MGA into master (investment) and subproblem (operation) components, reformulating the slack constraint via operational cost functions. Parallelization and cut-sharing across MGA runs further improve performance, with speed-ups of $3\times$ – $34\times$ in large macro-energy models (Lau et al., 29 Oct 2025).
Efficient Enumeration of Discrete Alternatives: For MILPs, recursive hyperrectangle algorithms or solution pooling enumerate all integer-feasible alternatives in the continuous near-optimal polyhedron (Schricker et al., 2023).
Hybrid Vector-Selection: Hybrid objective-set approaches (combining random and axis/MinMax directions) maximize coverage and efficiency for a given computational budget (Lau et al., 2024, Kchaou et al., 29 Dec 2025).
Continuous Exploration/Interpolation: Modelling to Generate Continuous Alternatives (MGCA) leverages the convexity of LPs to interpolate interior solutions via convex combinations of sampled extremes, enabling interactive Pareto frontier tracing and trade-off analysis in milliseconds (Lau et al., 2024).

5. Interpretation, Analysis, and Decision Support

The primary use of MGA alternatives is to support decision-making where strict optimality is either unnecessary or inappropriate, given unmodeled constraints, political objectives, or uncertainty (Lau et al., 2024, Lombardi et al., 2022, Kchaou et al., 29 Dec 2025). Typical analysis involves:

Diversity Metrics: Compute convex-hull volumes, pairwise distances, Shannon entropy, and clustering to quantify exploration of solution space (Lau et al., 2024, Kchaou et al., 29 Dec 2025, Lombardi et al., 2022).
Interpretability Tools: Apply ML-based clustering, rule-extraction (decision trees), or decision-table aggregation to summarize large ensembles into tractable archetypes (Kchaou et al., 29 Dec 2025).
Robustness and Sensitivity: Employ targeted MGA counterfactuals as ad hoc sensitivity analyses to test the “knife-edge” character of policy conclusions—e.g., whether a design feature is always present in all near-optimal solutions (Lombardi et al., 2022).
Stakeholder Engagement: Human-in-the-loop MGA incorporates domain-expert feedback to iteratively guide exploration toward more operationally relevant or acceptable alternatives in grid, budget, or public-sector contexts (Bannmüller et al., 22 Sep 2025).

Illustrative Table: MGA Solution Space Analysis

Analysis Type	Metrics	References
Diversity	Convex hull volume, pairwise Euclidean/cosine distances	(Lau et al., 2024, Kchaou et al., 29 Dec 2025)
Archetyping	k-means/prototypes, decision tree rule extraction	(Kchaou et al., 29 Dec 2025)
Sensitivity/Robustness	Alternative existence under constraints/perturbations	(Lombardi et al., 2022)
Feature set/hypothesis diversity	Dice distance, margin constraints in selection/generation	(Bach, 2023, Peng et al., 2020)

By combining quantitative and qualitative interrogation of the MGA solution ensemble, researchers and planners obtain a full map of the feasible alternative landscape, robust to uncertainty and model misspecification.

6. Practical Guidelines and Limitations

Empirical experience and benchmark studies recommend:

Set the budget-slack $\varepsilon$ judiciously (typically 5–10%): too loose a slack yields an impractically large and uninformative solution space; too tight, little diversity and high computational cost (Lau et al., 2024, Lombardi et al., 2022).
Focus MGA variability on structural or investment variables (not operational/generation flows directly); re-dispatch each candidate to recover cost-optimal operation (Lau et al., 2024).
Select objectives using parallelizable or hybrid methods. Random plus axis-minimization ensures simultaneous coverage of both convex hull and extreme points (Lau et al., 2024, Kchaou et al., 29 Dec 2025).
For mixed-integer or very high-dimensional problems, leverage parallelized Benders/cutting-plane, solution-pooling, or recursive enumeration, and monitor solution efficiency and memory footprint (Lau et al., 29 Oct 2025, Schricker et al., 2023).

Scope and limitations include computational tractability for very high-dimensional convex hull construction (MAA/Quickhull is currently limited to $\lesssim15$ variables (Kchaou et al., 29 Dec 2025)), practical interpretability for very large ensembles, and the need for model-specific treatment of attributes, feasibility, and post-processing.

7. Broader Implications and Future Directions

MGA represents a paradigm shift away from single-optimum reporting toward robust, stakeholder-oriented, and uncertainty-aware planning. Its theoretical framework unifies classical parametric optimization (sublevel-set, convex-polytopic geometry, Pareto frontier tracing), algorithmic innovation (hybridized solves, simplex modification, post-processing), and statistical considerations (mode coverage, hypothesis space exploration). Ongoing research seeks to extend MGA techniques to fully general nonlinear and stochastic programming, integrate effective dimensionality reduction and interpretable ML at scale, and systematize interactive decision support for real-world planning environments (Lau et al., 2024, Funke et al., 2024, Kchaou et al., 29 Dec 2025).

The result is a modeling approach that transparently exposes system flexibility, reveals non-obvious trade-offs and knife-edge design features, and strengthens both the technical and practical foundations of decision support under uncertainty.