A corrected proof of a result of Grinold

DOI10.1016/0022-247X(84)90238-5MaRDI QIDQ799476zbMATH OpenFDO

Authors Edward J. Anderson

Publication date 1984

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(84)90238-5

zbMATH Keywords

continuous linear programs

Mathematics Subject Classification ID

Linear programming (90C05) Methods of successive quadratic programming type (90C55)

Review text

In this note we correct the proof of a result of \textit{R. C. Grinold} [ibid. 28, 32-51 (1969; Zbl 0218.90055)] on continuous linear programs.

Cites work

• A class of continuous linear programming problems
• Continuous programming. I: Linear objectives
• Continuous programming. II: Nonlinear objectives
• Continuous time programming with nonlinear constraints
• Continuous time programming with nonlinear time-delayed constraints
• scientific article; zbMATH DE number 3525695 (Why is no real title available?)
• Sufficient Conditions for Kuhn–Tucker Vectors in Convex Programming
• Symmetric Duality for Continuous Linear Programs

Cited in

(1)

• Fine-Tuning Groth-Sahai Proofs

This page was built for publication: A corrected proof of a result of Grinold

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