Search arXiv⌕ Search

arXiv · 2610.05169

Ambiguity-Aware Multi-Agent Framework for Automated Operations Research under Logical Inconsistency

Abstract

Operations research (OR) problems are often described by stakeholders with incomplete knowledge and vague expressions in real-world settings. Such ambiguous descriptions can not be used to formulation directly. Thus, automating OR problems solving requires processing this logical inconsistency in advance. To address this challenge, we propose an \textbf{A}mbiguity-Aware \textbf{M}ulti-Agent Framework for \textbf{A}utomated \textbf{O}R Problem Solving, \textbf{AMAO}, which first addresses logical inconsistency through two-stage alignment before downstream formulation and coding. Specifically, a logical alignment agent with OR-guided experts structure first produces an aligned candidate using supervised routing over variables, parameters, objectives, and constraints. Then, a source-sufficiency verifier determines whether the original description supports the required repairs. When evidence is insufficient, an interactive repair agent requests additional information and revises the description before modeling and coding. In addition, an ambiguity-aware benchmark and its matched dialogue extension are proposed to support evaluation of both stages. The 32B model achieved 86.8\% error-recovery success and 60.4\% solution accuracy, reaching 1.98 and 1.86 times the respective base-model scores. The 8B model achieved 47.9\% solution accuracy, exceeding the best evaluated variant such as DeepSeek-V4-Flash and Claude-sonnet-4.5. Interactive repair further achieved 90.71\% complete-description accuracy when cases requiring clarification. These results support combining context-based repair with evidence assessment and targeted user clarification for automated OR modeling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chengxi She, Xingyu Lu, Yue Zhao, Qitao Shi, Caihua Chen. 2026-10-04. Ambiguity-Aware Multi-Agent Framework for Automated Operations Research under Logical Inconsistency. https://arxiv.org/abs/2610.05169

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Diagonally forced systems and the spectral signature of matrix cycles

Given any square matrix, $\mathbf{M}$, whose diagonal elements are negative, and which are multiplied by a variable, $σ$, we wish to find the minimal $σ$ such that the eigenvalue of $\mathbf{M}_σ$ is exactly zero. By Gershgorin, we know that $\mathbf{M}_σ$ can be made stable by making $σ$ large enough. We prove a relation which analytically determines when and how we are able to find the value of $σ$ such that the maximal eigenvalue is exactly zero. In so doing, we prove the equivalence of the roots of the characteristic polynomial of $\mathbf{M}_σ$ and the eigenvalues that arise from a scaling operation on $\mathbf{M}$. Further, through the characteristic polynomial, we are able to isolate the dominant feedback cycles comprising the elements of the matrix which, under the action of $σ$, ensures the stability of the system. We then explore, using the stabilising and destabilising cycles within the coefficients of the characteristic polynomial, an intrinsic spectral signature associated with any square matrix based on the sign (or zero) of its respective elements.

math.OC↗

Nonlinear Control Allocation: A Polynomial Approach

Control allocation maps the virtual control inputs requested by a high-level control law onto the physical actuators of a system. When the actuator authority is strongly nonlinear, existing methods rely on local linearization, on incremental updates, or on general nonlinear programming, and may be inaccurate, slow, or trapped in local optima. This paper introduces Polynomial Control Allocation, in which the cost and constraints of the allocation problem are polynomial or rational functions of the states and inputs; radical, trigonometric and tabulated nonlinearities are accommodated by lifting. The first order optimality conditions then form a parametric system of polynomial equations. Its Gr{ö}bner basis and the associated multiplication matrices are computed once, offline. Online, the matrices are evaluated at the current state and all solutions are recovered from the eigenvectors of a random linear combination of them, so that the globally optimal allocation is selected at a predictable computational cost. The framework is illustrated on thrust control of a variable-pitch propeller and on multicopter force allocation, and its computational cost is quantified in terms of polynomial evaluation and eigenvector computation. The method is validated experimentally on a Quanser helicopter model at a 500 Hz control rate, where a two-layer allocation scheme combined with linear model predictive control decouples travel and elevation over multiple full rotations. Monte Carlo comparisons with nonlinear programming and incremental nonlinear control allocation show that Polynomial Control Allocation achieves the lowest allocation error together with the shortest computation time.

math.OC↗

Notes on the discretization of TV-NORM regularized inverse potential problems

We describe a method to discretize optimization problems arising in the regularization of linear inverse problem having compact forward operator defined on 3-D valued measures, compactly supported on a fixed set. The criterion is a quadratic residual attached to the data, with an additive penalization of the total variation of the measure.

math.OC↗