The Convex Simplex Method
From MaRDI portal
Publication:5532893
DOI10.1287/mnsc.14.3.221zbMath0153.49002OpenAlexW2044525817MaRDI QIDQ5532893
Publication date: 1967
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.14.3.221
Related Items (28)
A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming ⋮ A feasible descent cone method for linearly constrained minimization problems ⋮ A forward convex-simplex method ⋮ A Lagrangean heuristic for the capacitated concave minimum cost network flow problem ⋮ Sur la convergence théorique de la méthode du gradient reduit généralise ⋮ Piecewise linear optimization ⋮ Geometric programming. Method and applications ⋮ Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato ⋮ An algorithm for linearly constrained nonlinear programming problems ⋮ Computer experiments on quadratic programming algorithms ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ A least-distance programming procedure for minimization problems under linear constraints ⋮ Simplex-inspired algorithms for solving a class of convex programming problems ⋮ Decomposition of the convex simplex method ⋮ Systematic construction of examples for cycling in the simplex method ⋮ A modified convace simplex algorithm for geometric programming ⋮ An algorithm for nonlinear programs over Cartesian product sets ⋮ Generalized reduced gradient method as an extension of feasible direction methods ⋮ A modified reduced gradient method for dual posynomial programming ⋮ A comparison of computational strategies for geometric programs ⋮ On a stochastic program with simple recourse ⋮ A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties ⋮ A modified reduced gradient method for a class of nondifferentiable problems ⋮ Linear max-min programming ⋮ Sur quelques méthodes de gradient réduit sous contraintes linéaires ⋮ Unnamed Item ⋮ A unified approach to the feasible direction methods for nonlinear programming with linear constraints ⋮ An interior feasible direction method with constraint projections for linear programming
This page was built for publication: The Convex Simplex Method
