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

DOI10.1007/BF02367671zbMATH Open0844.90087MaRDI QIDQ1915674FDOQ1915674

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

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

zbMATH Keywords

unconditional minimizationflexible polyhedron method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)

Cited In (2)

• Elimination of parasitic solutions in the theory of flexible polyhedra
• Title not available (Why is that?)

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)