scientific article; zbMATH DE number 3843508

zbMATH Open0531.90078MaRDI QIDQ3313633FDOQ3313633

E. G. Belousov, V. M. Shironin, V. G. Andronov

Publication date: 1982

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

Recommendations

• scientific article; zbMATH DE number 557207
• Polynomial solvability of special problems of disjunctive programming
• On the solution existence to convex polynomial programs and its applications
• On linear programming relaxations for solving polynomial programming problems
• On the solution existence and stability of polynomial optimization problems
• scientific article
• Polynomial optimization problems and their relaxations
• scientific article; zbMATH DE number 3922374
• A class of polynomially solvable 0-1 programming problems and an application
• Polynomially solvable satisfiability problems

zbMATH Keywords

polynomial programmingpolyhedral domain

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Mathematical programming (90C99)

Cited In (10)

• Existence and sensitivity analysis for nonconvex cubic optimization problems
• Optimality Conditions for Minimizers at Infinity in Polynomial Programming
• Complexity, exactness, and rationality in polynomial optimization
• Solution sets of quadratic complementarity problems
• A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
• Existence of solutions of extremal problems
• Title not available (Why is that?)
• On a Frank-Wolfe type theorem in cubic optimization
• Title not available (Why is that?)
• On the complexity of testing attainment of the optimal value in nonlinear optimization

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