Class LinearProgramming

java.lang.Object

org.episteme.core.mathematics.optimization.LinearProgramming

public class LinearProgramming
extends Object

Linear programming using Simplex algorithm.

Solves: minimize c^T x subject to Ax ≤ b, x ≥ 0

Since:

1.0

Author:

Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

Constructor Summary

Constructors

Constructor	Description
LinearProgramming()

Method Summary

Modifier and Type	Method	Description
static Real[]	dualSimplex(Real[] c, Real[][] A, Real[] b)	Dual simplex algorithm.
static Real[]	simplex(Real[] c, Real[][] A, Real[] b)	Simplex algorithm for linear programming.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

LinearProgramming

public LinearProgramming()

Method Details

simplex

public static Real[] simplex(Real[] c,
 Real[][] A,
 Real[] b)

Simplex algorithm for linear programming.

Standard form: min c^T x, Ax = b, x ≥ 0

Parameters:

c - objective coefficients (n)

A - constraint matrix (m × n)

b - right-hand side (m)

Returns:

optimal solution x, or null if infeasible/unbounded

dualSimplex

public static Real[] dualSimplex(Real[] c,
 Real[][] A,
 Real[] b)

Dual simplex algorithm.

Useful when starting from infeasible but dual-feasible solution.