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

An algorithm for solving the convex feasibility problem

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

DOI10.1504/IJOR.2007.012855zbMath1171.90473MaRDI QIDQ2474684

Abdulwahab Al-Othman, Mohammed A. Hajeeh

Publication date: 6 March 2008

Published in: International Journal of Operational Research (Search for Journal in Brave)


zbMATH Keywords

volumetric centerseparating hyperplaneline searchesvolumetric cutting plane algorithm


Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)








This page was built for publication: An algorithm for solving the convex feasibility problem

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