TheDocumentation Index
Fetch the complete documentation index at: https://mintlify.com/FabianeloV/Metodo-simplex/llms.txt
Use this file to discover all available pages before exploring further.
/api/v1/bisection/solve endpoint finds the optimum of a single-variable polynomial function on a specified interval [a, b]. Rather than minimising or maximising f(x) directly, the solver applies the Bisection method to the first derivative f′(x) to locate the root where f′(x) = 0. The nature of the critical point (maximum, minimum, or inflection) is then verified with the second derivative.
Request
POST /api/v1/bisection/solve
Polynomial coefficients listed from highest to lowest degree. Must contain between 1 and 11 elements (degree 0 through 10). The array must not be all-zero.Examples:
[-1, 4, 0]→-x² + 4x + 0[1, -3, 2]→x² - 3x + 2[2, 0, -8, 0]→2x³ - 8x
Optimisation direction. Accepted values:
"max" or "min".Left endpoint of the search interval. Must be strictly less than
b.Right endpoint of the search interval. Must be strictly greater than
a.Convergence tolerance. The algorithm stops when the interval width falls below this value. Must be greater than
0 and at most 1.0.Maximum number of bisection steps. Accepted range: 1–500.
Response
A successful call returns aBisectionResponse object.
Always
"optimal" for a completed bisection run (convergence or max_iterations reached).The x-coordinate of the located critical point.
null if no root of f′(x) was found in [a, b].The function value
f(optimal_x). null if no critical point was found.Classification of the critical point:
"maximum", "minimum", or "inflection point". null if no critical point was found.true when the nature of the found point matches the requested goal (e.g. a minimum was found when goal is "min").Actual number of bisection iterations performed before convergence.
Step-by-step iteration table, one entry per bisection step.
Human-readable string representation of
f(x) (e.g. "-x**2 + 4*x").Human-readable string representation of
f′(x) (e.g. "-2*x + 4").Human-readable summary of the result.
Example
Maximize f(x) = −x² + 4x on the interval[0, 4].
Coefficients from highest to lowest degree: [-1, 4, 0] (i.e. −1·x² + 4·x + 0).
The solver applies the Bisection method to
f′(x), not to f(x) itself. Make sure the target critical point lies inside [a, b] and that f′(a) and f′(b) have opposite signs so the algorithm can bracket the root.Health Check
GET /api/v1/bisection/health
Returns a liveness confirmation for the Bisection Optimization service.