oxiz-math 0.3.1

Mathematical foundations for OxiZ SMT solver
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

//! # Linear Programming Example
//!
//! This example demonstrates linear programming algorithms.
//! It covers:
//! - Simplex method (primal and dual)
//! - Feasibility checking
//! - Optimization (min/max)
//! - Sensitivity analysis
//! - Integer linear programming basics
//!
//! ## Linear Programming
//! Optimize a linear objective subject to linear constraints.
//! Forms the basis for LRA and LIA theory solving in SMT.
//!
//! ## Complexity
//! - Simplex: O(2^n) worst case, polynomial average
//! - Interior point: O(n^3.5) polynomial
//! - Branch-and-bound (ILP): Exponential
//!
//! ## See Also
//! - [`LPSolver`](oxiz_math::lp_core::LPSolver)
//! - [`DualSimplexSolver`](oxiz_math::lp::DualSimplexSolver)
//!
//! Note: This example is a placeholder. The full LP API is available in
//! oxiz_math::lp and oxiz_math::lp_core modules.

fn main() {
    println!("=== OxiZ Math: Linear Programming ===\n");
    println!("Linear programming modules available:");
    println!("  - oxiz_math::lp_core::LPSolver - Full LP solver");
    println!("  - oxiz_math::lp::DualSimplexSolver - Dual simplex method");
    println!("  - oxiz_math::lp::BranchCutSolver - Branch and cut (MIP)");
    println!("  - oxiz_math::lp::CuttingPlaneGenerator - Cutting plane methods");
    println!("  - oxiz_math::lp::FarkasGenerator - Infeasibility certificates");
    println!("\nSee the module documentation for detailed usage.");
}