The Convex Simplex Method

DOI10.1287/MNSC.14.3.221MaRDI QIDQ5532893zbMATH OpenOpenAlexFDO

Authors Willard I. Zangwill

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

zbMATH Keywords

operations research

Cited in

(29)

• A unified approach to the feasible direction methods for nonlinear programming with linear constraints
• A forward convex-simplex method
• 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
• A least-distance programming procedure for minimization problems under linear constraints
• Decomposition of the convex simplex method
• 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 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 Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties
• A modified convace simplex algorithm for geometric programming
• Systematic construction of examples for cycling in the simplex method
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
• An algorithm for nonlinear programs over Cartesian product sets
• scientific article; zbMATH DE number 4160450 (Why is no real title available?)
• 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
• Sur la convergence théorique de la méthode du gradient reduit généralise
• Fair integer programming under dichotomous and cardinal preferences
• An interior feasible direction method with constraint projections for linear programming
• Simplex-inspired algorithms for solving a class of convex programming problems

This page was built for publication: The Convex Simplex Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5532893)