edu.princeton.cs.algorithms

Class Simplex

java.lang.Object

edu.princeton.cs.algorithms.Simplex

public class Simplex
extends Object

Compilation: javac Simplex.java Execution: java Simplex Given an M-by-N matrix A, an M-length vector b, and an N-length vector c, solve the LP { max cx : Ax <= b, x >= 0 }. Assumes that b >= 0 so that x = 0 is a basic feasible solution. Creates an (M+1)-by-(N+M+1) simplex tableaux with the RHS in column M+N, the objective function in row M, and slack variables in columns M through M+N-1.

Constructor Summary

Constructors

Constructor and Description
Simplex(double[][] A, double[] b, double[] c)

Method Summary

Methods

Modifier and Type	Method and Description
double[]	dual()
static void	main(String[] args)
double[]	primal()
void	show()
static void	test(double[][] A, double[] b, double[] c)
static void	test1()
static void	test2()
static void	test3()
static void	test4()
double	value()

Methods inherited from class java.lang.Object

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

Constructor Detail

Simplex

public Simplex(double[][] A,
       double[] b,
       double[] c)

Method Detail

value

public double value()

primal

public double[] primal()

dual

public double[] dual()

show

public void show()

test

public static void test(double[][] A,
        double[] b,
        double[] c)

test1

public static void test1()

test2

public static void test2()

test3

public static void test3()

test4

public static void test4()

main

public static void main(String[] args)