# `linopt` - library for linear optimization

## Table of contents

1. `corners` - return the feasible corners of a linear program
2. `maximize` - maximize a linear or mixed-integer program
3. `minimize` - minimize a linear or mixed-integer program
4. `plot_data` - plot the feasible region of a linear program
5. `Transparent` - return the ordinary simplex tableau of a linear program
6. `Transparent::autostep` - perform the next simplex step
7. `Transparent::clean_basis` - delete all slack variables of the first phase from the basis
8. `Transparent::convert` - transform the given tableau into a structure printable on screen
9. `Transparent::dual_prices` - get the dual solution belonging to the given tableau
10. `Transparent::phaseI_tableau` - start an ordinary phase one of a 2-phase simplex algorithm
11. `Transparent::phaseII_tableau` - start phase two of a 2-phase simplex algorithm
12. `Transparent::result` - get the basic feasible solution belonging to the given simplex tableau
13. `Transparent::simplex` - finish the current phase of the 2-phase simplex algorithm
14. `Transparent::suggest` - suggest the next step in the simplex algorithm
15. `Transparent::userstep` - perform a user defined simplex step

Do you have questions or comments?
Copyright © SciFace Software GmbH & Co. KG 2000