scientific article; zbMATH DE number 3850835

zbMATH Open0535.90076MaRDI QIDQ3320136FDOQ3320136

Authors: János Fülöp 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4053360
• scientific article; zbMATH DE number 3867078
• Finite method of minimizing a concave function under linear constraints and applications
• scientific article; zbMATH DE number 124014
• scientific article; zbMATH DE number 1537598
• On the minimization of a quasi-concave function subject to linear constraints
• On the problem of minimizing a difference of polyhedral convex functions under linear constraints
• scientific article; zbMATH DE number 4079167
• scientific article; zbMATH DE number 4187464
• scientific article; zbMATH DE number 4037615

zbMATH Keywords

linear constraintsconcave functionfinite cutting plane methodconvex cutsconvex polyhedral domain

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited In (2)

• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Title not available (Why is that?)

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