Pages that link to "Item:Q941039"
From MaRDI portal
The following pages link to Simplex-inspired algorithms for solving a class of convex programming problems (Q941039):
Displaying 9 items.
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- A simplicial algorithm for concave minimization and its performance as a heuristic tool (Q934181) (← links)
- A forward convex-simplex method (Q1089264) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Note: An algorithm to solve polyhedral convex set optimization problems (Q2808332) (← links)
- (Q3221762) (← links)
- (Q4300099) (← links)
- (Q5462190) (← links)