Irreducible System of Constraints for a General Polyhedron of Arrangements
We construct a system of constraints for a general polyhedron of arrangements that does not contain superfluous inequalities. The derivation of an irreducible system enables one to substantially reduce the number of operations necessary for finding exact solutions of optimization problems on arrange...
Saved in:
| Date: | 2003 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Article |
| Language: | Ukrainian English |
| Published: |
Institute of Mathematics, NAS of Ukraine
2003
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/3882 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |