scientific article; zbMATH DE number 4130198

MaRDI QIDQ3032094zbMATH OpenFDO

Authors V. P. Khachaturov, S. L. Utkin

Publication date 1988

zbMATH Keywords

approximate combinatorial methodapproximating functionsconcave additive separable functionconvex polyhedronmulti-extremal problemssurvey

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• An approximation algorithm for convex multi-objective programming problems
• scientific article; zbMATH DE number 3307152
• A general purpose exact solution method for mixed integer concave minimization problems
• An algorithm for approximate multiparametric convex programming
• An approximate method for solving the convex programming problem
• scientific article; zbMATH DE number 3847229
• On Approximate Solutions for Combinatorial Optimization Problems
• Convex mixed integer nonlinear programming problems and an outer approximation algorithm
• A duality bound method for solving concave multiplicative programming with exponents

Cited in

(5)

• On the constructive solution of convex programming problems in separable form
• An optimal adaptive algorithm for the approximation of concave functions
• Combinatorial optimization solution of the optimal extremum problem of function
• scientific article; zbMATH DE number 203962 (Why is no real title available?)
• C-programming and the minimization of pseudolinear and additive concave 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 Q3032094)