A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
✍ Scribed by Matthew D. Johnston; David Siegel; Gábor Szederkényi
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 251 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. Frederickson and Solis‐Oba gave an
## Abstract In recent literature, several alternative conditions for the existence of solutions to active networks are given. In this paper, yet another condition is given which is both necessary and sufficient for the existence of a unique solution to the network. Based on this new condition a pre