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

Optimal simplex tableau characterization of unique and bounded solutions of linear programs

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

DOI10.1007/BF00934707zbMath0438.90050MaRDI QIDQ1142157

Olvi L. Mangasarian

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)


zbMATH Keywords

uniqueness of solutionssimplex methodboundedness of solutionsoptimal simplex tableau


Mathematics Subject Classification ID

Linear programming (90C05)


Related Items

Minimum principle sufficiency



Cites Work

  • Unnamed Item
  • Uniqueness of solution in linear programming
  • Boundedness relations for linear constraint sets
  • Remark on the Constraint Sets in Linear Programming
  • Complementarity Theorems for Linear Programming
  • Marginal Values in Linear Programming


This page was built for publication: Optimal simplex tableau characterization of unique and bounded solutions of linear programs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1142157&oldid=13196201"
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 04:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki