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

Linear programming with inequality constraints via entropic perturbation

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

DOI10.1155/S0161171296000257zbMath0843.90080OpenAlexW2122028571MaRDI QIDQ1907719

Shu-Cherng Fang, H.-S. Jacob Tsao

Publication date: 13 February 1996

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/47472


zbMATH Keywords

linear inequality constraintsperturbation method\(\varepsilon\)-optimal solutioncross-entropy minimizationentropic perturbationdual convex programmingentropic path-following


Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)


Related Items (2)

An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints ⋮ Silving Linear Programs With Inequality Constraints Via Perturbation of Feasible Region







This page was built for publication: Linear programming with inequality constraints via entropic perturbation

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