A computer-implemented method for generating a feasibility indication indicative of the feasibility of a weapon carried on an aircraft in flight to successfully engage a target and / or the feasibility of a weapon carried on the target to successfully engage the aircraft, the method comprising: providing a
database describing a performance envelope of the weapon; a) generating candidate polynomials, the polynomial variables being some or all of a group of weapon or aircraft firing condition parameters; and b) for each candidate polynomial, comparing the candidate polynomial to the performance envelope of the weapon using a
least squares error criterion. calculating coefficients for the candidate polynomial that best fits the characteristics of the line; c) for each candidate polynomial, generating a candidate
score according to the quality of the candidate polynomial's fit to the characteristics of the weapon's performance envelope; d) applying a
genetic algorithm to the candidate polynomials and scores, including selecting the best scoring polynomial(s) and discarding the other polynomial(s), thereby identifying the best candidate polynomial and its coefficients; and e) repeating the identification process until all required characteristics of the performance envelope have a corresponding polynomial model. d) a method for generating coefficients characteristic of a performance envelope using a generic
algorithm, wherein the generic
algorithm has the form of a polynomial, uploading coefficients of the identified best candidate polynomial to the aircraft, selecting coefficients for the generic
algorithm according to aircraft and target conditions by a reconfigurator on the aircraft containing the same generic algorithm, and generating a feasibility indication by the reconfigurator using the selected coefficients, the method comprising: i) defining a set of orders and / or types of candidate polynomials and dividing the defined set of orders and / or types into a plurality of subsets thereof; ii) iteratively applying the
genetic algorithm simultaneously across a plurality of subsets of the defined set of orders and / or types of candidate polynomials, including iteratively applying the
genetic algorithm across polynomial variables for each order and / or type of each subset of polynomials and saving the resulting respective coefficients and their scores;iii) using the saved coefficients and scores to select the best scoring polynomial(s) and discard other polynomial(s), thereby identifying the best candidate polynomials and their coefficients.