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

DOI10.1016/0022-247X(78)90180-4zbMATH Open0383.90073OpenAlexW2083550175MaRDI QIDQ1248461FDOQ1248461

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence Conditions for Nonlinear Programming Algorithms
• 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
• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions

Cited In (9)

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

This page was built for publication: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality

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