Repair the Action, Preserve the Intent: Minimal Feasibility Projection for Power-Grid Agents

Language-model agents can translate operator requests into power-grid actions, but an executable switching or redispatch command can violate connectivity, generator, voltage, thermal, or operational-goal constraints. Re-prompting until a simulator accepts a command supplies neither a minimality guarantee nor a boundary on how much of the request may be replaced. We formulate intent-preserving feasibility repair: search a declared finite mixed discrete-continuous neighborhood in lexicographic order of action type, target, support, magnitude, and finally operating cost. Our implementation, IPFR, validates semantic edit buckets with AC power flow, returns the lowest-cost action in the first feasible bucket, and explicitly refuses when the neighborhood contains no admissible repair. This yields soundness and lexicographic minimality relative to the declared neighborhood, without assigning commensurate weights to semantic and monetary quantities. On 120 held-out scenarios from IEEE 57- and 118-bus systems, IPFR finds an AC-feasible action in all 108 repairable cases and refuses all 12 infeasible controls. In 73 conditional, adversarial priority-conflict cases it preserves the proposed action type and target in every case, whereas cost-first feasibility projection does so in none. These cases test contract compliance, not field prevalence. IPFR uses 4.77 AC validations per repairable case versus 60.07 for an exhaustive lexicographic oracle and agrees with that oracle on every selected action. Euclidean and development-tuned scalar projections match its actions at ordinary units but require exhaustive search and lose unit invariance. The contribution is a verifiable boundary between correcting an unsafe agent and silently replacing what it was asked to do.