scientific article; zbMATH DE number 4176856

MaRDI QIDQ3200905zbMATH OpenFDO

Authors E. A. Sideri

Publication date 1989

zbMATH Keywords

convex non-smooth programmingcutting plane algorithm

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25) Fractional programming (90C32)

Recommendations

• A Cutting Plane Algorithm for Min-Max Fractional Programming
• Generalized fractional programming and cutting plane algorithms
• A projection cutting plane algorithm for convex programming problems
• scientific article; zbMATH DE number 1778406
• scientific article; zbMATH DE number 4172771

Cited in

(4)

• A cutting plane method for solving minimax problems in the complex plane
• Generalized fractional programming and cutting plane algorithms
• A cutting method for finding discrete minimax with dropping of cutting planes
• A Cutting Plane Algorithm for Min-Max Fractional Programming

This page was built for publication:

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