An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality

DOI10.1016/0022-247X(78)90180-4zbMath0383.90073OpenAlexW2083550175MaRDI QIDQ1248461

Mokhtar S. Bazaraa, Jamie J. Goode, Ronald L. Rardin

Publication date: 1978

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(78)90180-4

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Polytopes and polyhedra (52Bxx)

Related Items

An analytical solution to the minimum \(L_ p\)-norm of a hyperplane, A maximum \(L_p\) distance problem, An algorithm for linearly constrained nonlinear programming problems, A survey on the continuous nonlinear resource allocation problem, A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Finding the closest point to the origin in the convex hull of a discrete set of points, An algorithm for least distance programming, A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Algorithms for some minimax problems
• Steepest Ascent for Large Scale Linear Programs
• Convergence Conditions for Nonlinear Programming Algorithms