A globally convergent method for semi-infinite linear programming

DOI10.1007/BF00138692zbMath0856.90111MaRDI QIDQ1924071

Yanyan Li

Publication date: 13 October 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

semi-infinite linear programmingglobally convergent methodnondifferentiable constraints

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (1)

The design of optimum component test plans in the demonstration of system reliability

Cites Work

• Unnamed Item
• Unnamed Item
• A one-phase algorithm for semi-infinite linear programming
• On approximate solutions of infinite systems of linear inequalities
• An interior point algorithm for semi-infinite linear programming
• Interior-point algorithms for semi-infinite programming
• Matrix eigensystem routines - EISPACK guide
• Semi-Infinite Programming: Theory, Methods, and Applications
• A Nonlinear Programming Problem in Statistics (Educational Testing)
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems

This page was built for publication: A globally convergent method for semi-infinite linear programming