Loading [MathJax]/jax/output/CommonHTML/config.js
Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2007, Issue 8, Pages 116–125 (Mi at1036)  
This article is cited in 5 scientific papers (total in 5 papers)

On the generalized Wolf problem: Preprocessing of nonnegative large-scale linear programming problems with group constraints

P.-O. Gutman, I. Ioslovich

Technion-Israel Institute of Technology, Haifa, Israel
Full-text PDF (208 kB) Citations (5)
References:
PDF
HTML
Abstract: Nonnegative large-scale linear programming problems with group constraints are extremely important for different applications in economics, technology, and other spheres. In this paper, we describe a new approach to preprocessing of these problems so that to reduce their dimensions considerably by defining and removing redundant constraints and variables.
Presented by the member of Editorial Board: L. B. Rapoport

Received: 15.02.2007
English version:
Automation and Remote Control, 2007, Volume 68, Issue 8, Pages 1401–1409
DOI: https://doi.org/10.1134/S0005117907080115
Bibliographic databases:
Document Type: Article
PACS: 02.60.Pn
Language: Russian
Citation: P.-O. Gutman, I. Ioslovich, “On the generalized Wolf problem: Preprocessing of nonnegative large-scale linear programming problems with group constraints”, Avtomat. i Telemekh., 2007, no. 8, 116–125; Autom. Remote Control, 68:8 (2007), 1401–1409
Citation in format AMSBIB
\Bibitem{GutIos07}
\by P.-O.~Gutman, I.~Ioslovich
\paper On the generalized Wolf problem: Preprocessing of nonnegative large-scale linear programming problems with group constraints
\jour Avtomat. i Telemekh.
\yr 2007
\issue 8
\pages 116--125
\mathnet{http://mi.mathnet.ru/at1036}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2354237}
\zmath{https://zbmath.org/?q=an:1143.93303}
\transl
\jour Autom. Remote Control
\yr 2007
\vol 68
\issue 8
\pages 1401--1409
\crossref{https://doi.org/10.1134/S0005117907080115}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34548381794}
Linking options:
  • https://www.mathnet.ru/eng/at1036
  • https://www.mathnet.ru/eng/at/y2007/i8/p116
    • This publication is cited in the following 5 articles:
    1. Estiningsih Y., Farikhin, Tjahjana R.H., International Conference on Mathematics, Science and Education 2017 (Icmse2017), Journal of Physics Conference Series, 983, IOP Publishing Ltd, 2018  crossref  isi  scopus
    2. Ioslovich I., Gutman P.-O., Lichtsinder A., “Robust Reduction of Dimension of a Linear Programming Problem with Uncertainties: Implication for Robust Production and Technology Planning”, Optimization Theory and Related Topics, Contemporary Mathematics, 568, eds. Reich S., Zaslavski A., Amer Mathematical Soc, 2012, 109–119  crossref  mathscinet  zmath  isi
    3. Paulraj S., Sumathi P., “A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems”, Math Probl Eng, 2010, 723402  zmath  isi
    4. G. Gutin, D. Karapetyan, “A selection of useful theoretical tools for the design and analysis of optimization heuristics”, Memetic Comp., 1:1 (2009), 25  crossref
    5. A. M. Lukatskii, D. V. Shapot, “A constructive algorithm for folding large-scale systems of linear inequalities”, Comput. Math. Math. Phys., 48:7 (2008), 1100–1112  mathnet  crossref  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:216
    Full-text PDF :72
    References:58
    First page:1
     
      Contact us:
    math-net2025_04@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025