TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # LOGIN   # REGISTER (FREE TRIAL)
  # myTOMLAB  
Products
*TOMLAB Base Module
 *Solvers
    clsSolve
    conSolve
    cutPlane
    DualSolve
    expSolve
    glbDirect
    glbFast
    glbSolve
    glcCluster
    glcDirect
    glcFast
    glcSolve
    goalSolve
    infLinSolve
    infSolve
    L1LinSolve
    L1Solve
    linRatSolve
    lpSimplex
    lsei
    milpSolve
    minlpSolve
    mipSolve
    multiMin
    multiMINLP
    nlpSolve
    pdco
    pdsco
    QLD
    qpSolve
    slsSolve
    sTrustr
    Tfmin
    Tfzero
    Tlsqr
    Tnnls
    ucSolve
*TOMLAB /MINOS
*TOMLAB /NPSOL
*TOMLAB /DNOPT
*TOMLAB /SNOPT
*TOMLAB /SOL
*TOMLAB /CGO
*TOMLAB /CPLEX
*TOMLAB /GUROBI
*TOMLAB /MINLP
*TOMLAB /MIPNLP
*TOMLAB /MISQP
*TOMLAB /PENSDP
*TOMLAB /PENBMI
*TOMLAB /KNITRO
*TOMLAB /OQNLP
*TOMLAB /PROPT
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /LGO-MINLP
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /MIDACO

lpSimplex

lpSimplex is a fast and robust simplex algorithm for linear programming, including crash basis saving and hot starts. It takes a general lower and upper bound format for both simple bound and linear constraints.

Main features

  • lpSimplex implements an active set strategy (Simplex method) for Linear Programming using an additional set of slack variables for the linear constraints.
  • Variable selection rule is one of: Minimum reduced cost, Bland's rule (default) and Minimum reduced cost ( Dantzig's rule).
  • If the given starting point is not feasible then a Phase I objective is used until a feasible point is found.
  • Warm start could be used with a basis from a file, or directly given in the TOMLAB Prob structure (the result from a previous run is automatically stored).

    Tomlab © 1989-2020. All rights reserved.    Last updated: Sep 17, 2020. Site map. Privacy Policy