simplex

package
v0.0.2 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Sep 24, 2025 License: MIT Imports: 3 Imported by: 0

Documentation

Overview

Package simplex provides core implementations of the simplex algorithm for solving linear programming problems.

It includes both the standard and revised simplex methods implemented over dense matrix representations.

This package is internal and intended for use within the gspl project only.

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type ExitFlag added in v0.0.2 

type ExitFlag int

ExitFlag represents the status code returned by the simplex solver. 

const (
	ExitUnbounded ExitFlag = iota - 1
	ExitOptimal
	ExitInfeasible
	ExitUnsolved // Represents some other issue in the solver i.e. not implemented
)

func RevisedSimplex 

func RevisedSimplex(A *mat.Dense, b, c *mat.VecDense, m, n int, Bmatrix *mat.Dense, indices_ *mat.VecDense, phase int) (z float64, x, pivalues, indices *mat.VecDense, exitflag ExitFlag)

RevisedSimplex implements the revised simplex algorithm.

It solves the LP in the specified phase (1 or 2) given an initial basis. Returns optimal objective, solution, duals, basis indices, and exit flag.

func Simplex 

func Simplex(A *mat.Dense, b, c *mat.VecDense, m, n int) (z float64, x, piValues, indices *mat.VecDense, exitflag ExitFlag)

Simplex solves the LP problem using the standard simplex method.

It calls RevisedSimplex for both phase 1 and phase 2 internally.

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.