scientific article; zbMATH DE number 3891108

MaRDI QIDQ3347643zbMATH OpenFDO

Authors Stane Indihar

Publication date 1985

zbMATH Keywords

bilinear programmingbounded polyhedronconvex function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Methods of successive quadratic programming type (90C55)

Recommendations

• scientific article; zbMATH DE number 4104722
• Global maximization of special classes of convex functions on a convex polyhedral set
• scientific article; zbMATH DE number 4108510
• scientific article; zbMATH DE number 4018776
• A note on the solution of bilinear programming problems by reduction to concave minimization

Cited in

(5)

• Optimality conditions for maximizing a function over a polyhedron
• Finding the Maximum Subset with Bounded Convex Curvature
• scientific article; zbMATH DE number 3942157 (Why is no real title available?)
• scientific article; zbMATH DE number 4104722 (Why is no real title available?)
• On the pointwise maximum of convex functions

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 Q3347643)