On the application of the flexible polyhedron method to solve mathematical programming problems

DOI10.1007/BF02367671MaRDI QIDQ1915674zbMATH OpenFDO

Authors A. I. Vafina, V. R. Fazylov

Publication date 30 June 1996

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/69122

zbMATH Keywords

flexible polyhedron methodunconditional minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Review text

The flexible polyhedron method is intended for solving unconditional minimization problems. To apply this method to the mathematical programming problem \(\min \varphi_0 (x)\), subject to \(\varphi_j (x) \leq 0\) \((j = 1, \dots, m)\), we introduce a comparison operation for two points \(x,y \in \mathbb{R}^n\) as follows: \(\Phi (x) : = \max \{0, \max \{\varphi_j (x) : j = 1, \dots, m\}\}\). This leads to a method which we used to solve problems of synthesis of a closed multidimensional system of automatic regulation and we show good efficiency. Several variants of the method are discussed.

Recommendations

• scientific article; zbMATH DE number 2000319
• An effective method for solving linear programming problems with flexible constraints
• Approximation of convex functions by projections of polyhedra
• A modification of the method of linearization for solving a mathematical programming problem on a simple set of ``parallelepiped type
• scientific article; zbMATH DE number 1533655

Cited in

(2)

• Elimination of parasitic solutions in the theory of flexible polyhedra
• scientific article; zbMATH DE number 911850 (Why is no real title available?)

This page was built for publication: On the application of the flexible polyhedron method to solve mathematical programming problems

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