Determination of optimal vertices from feasible solutions in unimodular linear programming
dc.contributor.author | Saigal, Romesh | en_US |
dc.contributor.author | Mizuno, Shinji | en_US |
dc.contributor.author | Orlin, James B. | en_US |
dc.date.accessioned | 2006-09-11T19:33:35Z | |
dc.date.available | 2006-09-11T19:33:35Z | |
dc.date.issued | 1993-03 | en_US |
dc.identifier.citation | Mizuno, Shinji; Saigal, Romesh; Orlin, James B.; (1993). "Determination of optimal vertices from feasible solutions in unimodular linear programming." Mathematical Programming 59 (1-3): 23-31. <http://hdl.handle.net/2027.42/47926> | en_US |
dc.identifier.issn | 0025-5610 | en_US |
dc.identifier.issn | 1436-4646 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47926 | |
dc.description.abstract | In this paper we consider a linear programming problem with the underlying matrix unimodular, and the other data integer. Given arbitrary near optimum feasible solutions to the primal and the dual problems, we obtain conditions under which statements can be made about the value of certain variables in optimal vertices. Such results have applications to the problem of determining the stopping criterion in interior point methods like the primal—dual affine scaling method and the path following methods for linear programming. | en_US |
dc.format.extent | 462554 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; The Mathematical Programming Society, Inc. | en_US |
dc.subject.other | Linear Programming | en_US |
dc.subject.other | Totally Unimodular | en_US |
dc.subject.other | Unimodular | en_US |
dc.subject.other | Duality Theorem | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Interior Point Methods | en_US |
dc.subject.other | Numerical Analysis | en_US |
dc.subject.other | Mathematics of Computing | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Numerical and Computational Methods | en_US |
dc.subject.other | Mathematical Methods in Physics | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.title | Determination of optimal vertices from feasible solutions in unimodular linear programming | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Department of Prediction and Control, The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, 106, Tokyo, Japan | en_US |
dc.contributor.affiliationother | Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47926/1/10107_2005_Article_BF01581235.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01581235 | en_US |
dc.identifier.source | Mathematical Programming | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.