Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Balance constraints reduction of large-scale linear programming problems

From MaRDI portal
Publication:1309865
Jump to:navigation, search

DOI10.1007/BF02025015zbMath0798.90104OpenAlexW2031899340MaRDI QIDQ1309865

M. Barbulescu, Neculai Andrei

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02025015


zbMATH Keywords

linear transformationssimplificationbalance constraints reduction


Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05)




Cites Work

  • Analysis of mathematical programming problems prior to applying the simplex algorithm
  • A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Balance constraints reduction of large-scale linear programming problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1309865&oldid=13425679"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki