Symmetric duality for lexicographic problems of linear programming
A symmetric pair of lexicographic linear-programming (LP) problems, connected by regular relations, is formulated for problems of multicriteria linear optimization. A duality theorem for improper linear-programming problems (ILPP) is constructed in terms of lexicographic optimization.
Saved in:
| Date: | 1992 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Russian |
| Published: |
Institute of Mathematics, NAS of Ukraine
1992
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/8007 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |