Generalized Linear Programming Solves the Dual

DOI10.1287/mnsc.22.11.1195zbMath0352.90059OpenAlexW2025329419MaRDI QIDQ4123097

No author found.

Publication date: 1976

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5346

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Lagrangian dual ascent by generalized linear programming, Existence of optimal Lagrange multipliers for certain nonconvex allocation problems, Robust Dual Dynamic Programming, Convergent duality for the traveling salesman problem, Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs, Decomposition in general mathematical programming, The omnipresence of Lagrange, Calculating surrogate constraints, Stochastic programming approaches to stochastic scheduling, On a primal-proximal heuristic in discrete optimization, A primal-proximal heuristic applied to the French unit-commitment problem