Abstract
We propose an approximate polynomial method that enables one to determine with given accuracy the extremum of a function on a permutation polyhedron with additional linear constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Yu. G. Stoyan and S. V. Yakovlev, “Properties of convex functions on a permutation polyhedron,” Dokl. Akad. Nauk Ukr. SSR, Ser. A, No. 3, 69–72 (1988).
Yu. G. Stoyan, S. V. Yakovlev, and O. G. Parshin, “Optimization of quadratic functions on a set of permutations mapped into R k,” Dokl. Akad. Nauk Ukr. SSR, Ser. A, No. 5, 73–77 (1989).
S. V. Yakovlev, “Theory of convex extensions of functions at vertices of convex polyhedra,” Zh. Vych. Mat. Mat. Fiz., 34, No. 7, 1112–1119 (1994).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, Optimization [in Russian], Nauka, Moscow (1981).
S. V. Yakovlev and O. A. Valuiskaya, “On the minimization of a linear function at vertices of a permutation polyhedron with linear constraints,” Dokl. Akad. Nauk Ukr., Ser. A, No. 11, 103–108 (1999).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yakovlev, S.V., Valuiskaya, O.A. Optimization of Linear Functions at the Vertices of a Permutation Polyhedron with Additional Linear Constraints. Ukrainian Mathematical Journal 53, 1535–1545 (2001). https://doi.org/10.1023/A:1014374926840
Issue Date:
DOI: https://doi.org/10.1023/A:1014374926840