Discrete problem of convex combinations and its applications

MaRDI QIDQ5954393zbMATH OpenFDO

Authors Alexander G. Kolpakov

Publication date 1 April 2002

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

convex combinationdiscrete problemnumerical algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Review text

The paper is devoted to discrete convex combination problems. In practice, a discrete problem of convex combinations arises, i.e., the problem of convex combinations whose coefficients assume values from a given set. A numerical method for constructing its general solution is suggested. Some test problems are presented.

Recommendations

• The solution of the convex combination problem
• Convex discrete optimization
• The theory of convex extensions in combinatorial optimization problems
• Discrete approximation of a problem of continuous programming
• scientific article; zbMATH DE number 480244

Cited in

(2)

• Combinatorial methods in the study of marginal problems over separable spaces
• The solution of the convex combination problem

This page was built for publication: Discrete problem of convex combinations and its applications

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