Intelligent gradient search in linear programming

DOI10.1016/0377-2217(85)90248-6zbMath0585.90056OpenAlexW2034899375MaRDI QIDQ1071647

B. George

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90248-6

zbMATH Keywords

gradient methodspolynomial-time algorithmimplementationmodificationspractical aspects

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (8)

Convergence results and numerical experiments on a linear programming hybrid algorithm ⋮ Projection method for solving systems of linear inequalities ⋮ Fuzzy optimization: An appraisal ⋮ Asymptotic behaviour of Karmarkar's method for linear programming ⋮ A linear programming approach to water-resources optimization ⋮ Sensitivity analysis in fuzzy linear programming ⋮ A Modified Termination Rule for Karmarkar’s Algorithm ⋮ A dual approach to solve the fuzzy linear programming problem

Uses Software

• XMP

Cites Work

• A new polynomial-time algorithm for linear programming
• The ellipsoid method and its consequences in combinatorial optimization
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Nonadjacent extreme point methods for solving linear programs
• The Constrained Gradient Method of Linear Programming
• Feature Article—The Ellipsoid Method: A Survey
• Reinversion with the preassigned pivot procedure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intelligent gradient search in linear programming