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
Discussion
View source
View history
Purge
English
Log in

A Dual Simplex Algorithm for Piecewise-Linear Programming

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

DOI10.1057/jors.1996.63zbMath0864.90085OpenAlexW2019606535MaRDI QIDQ4717146

Francis J. Nourie, Faruk Güder

Publication date: 22 June 1997

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

Full work available at URL: https://doi.org/10.1057/jors.1996.63


zbMATH Keywords

piecewise-linear programmingconvex separable piecewise-linear functionsdual piecewise-linear simplex algorithm


Mathematics Subject Classification ID

Linear programming (90C05)


Related Items (1)

A parametric simplex algorithm for biobjective piecewise linear programming problems







This page was built for publication: A Dual Simplex Algorithm for Piecewise-Linear Programming

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