Now showing items 1-1 of 1

    • Constraint Optimal Selection Techniques (COSTs) For Linear Programming 

      Saito, Goh (Industrial & Manufacturing Engineering, 2012-07-25)
      Simplex pivoting algorithms remain the dominant approach to solve linear programming (LP) because they have advantages over interior-point methods. However, current simplex algorithms are often inadequate for solving a ...