Simplex-inspired algorithms for solving a class of convex programming problems

DOI10.1007/s11590-007-0073-2zbMath1152.90563OpenAlexW1974716210MaRDI QIDQ941039

Thomas C. Sharkey, H. Edwin Romeijn

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-007-0073-2

zbMATH Keywords

convex optimizationnonlinear programmingsimplex method

Mathematics Subject Classification ID

Convex programming (90C25) Extreme-point and pivoting methods (90C49)

Related Items

A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
• The simplex method. A probabilistic analysis
• On the average number of steps of the simplex method of linear programming
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• On optimality conditions in nondifferentiable programming
• Interior Methods for Nonlinear Optimization
• The Convex Simplex Method