Overview of the simplex Package - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Packages : simplex

Overview of the simplex Package

 

Calling Sequence

Description

List of simplex Package Commands

List of simplex package conversions

List of simplex package types

Examples

References

Calling Sequence

simplex[command](arguments)

command(arguments)

Description

• 

The simplex package is a collection of routines for linear optimization using the simplex algorithm as a whole, and using only certain parts of the simplex algorithm.

• 

In addition to the routines feasible, maximize, and minimize, the simplex package provides routines to assist the user in carrying out the steps of the algorithm one at a time: setting up problems, finding a pivot element, and executing a single pivot operation.

• 

To directly obtain a numerical solution to a linear program, it is recommended that you use the Optimization[LPSolve] command, which is more efficient for this purpose.

• 

Each command in the simplex package can be accessed by using either the long form or the short form of the command name in the command calling sequence.

List of simplex Package Commands

• 

The following is a list of available commands:

basis

convexhull

cterm

define_zero

display

dual

feasible

maximize

minimize

pivot

pivoteqn

pivotvar

ratio

setup

standardize

 

  

To display the help page for a particular simplex command, see Getting Help with a Command in a Package.

List of simplex package conversions

• 

The following is a list of conversions in the simplex package:

equality

std

stdle

 

List of simplex package types

• 

The following is a list of types that are limited to the simplex package:

NONNEGATIVE

 

 

 

Examples

withsimplex:

cnsts3x+4y3z23,5x4y3z10,7x+4y+11z30:

objx+y+2z:

maximizeobj,cnsts∪0x,0y,0z

x=0,y=498,z=12

(1)

maximizeobj,cnsts,NONNEGATIVE

x=0,y=498,z=12

(2)

maximizeobj,cnsts

References

  

The implementation of the simplex algorithm is based on the initial chapters of:

  

Chvatal. Linear Programming. New York: W.H. Freeman and Company, 1983.

See Also

Optimization[LPSolve]

UsingPackages

with

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam