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

Unrestricted variables in linear programming

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

DOI10.1007/BF00940691zbMath0702.90051OpenAlexW2133427735MaRDI QIDQ915645

Schechter, Martin

Publication date: 1991

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

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


zbMATH Keywords

extreme pointsunrestricted variables


Mathematics Subject Classification ID

Linear programming (90C05)


Related Items (1)

A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Finding all vertices of a convex polyhedron
  • Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities


This page was built for publication: Unrestricted variables in linear programming

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