Yinrun Lyu

Papers

Total Citations

H-Index

About

Yinrun Lyu is a researcher whose work lies at the intersection of optimization theory and computational logic. Her primary research focus is on solving linear optimization problems constrained by arithmetic formulas—a niche but foundational area that bridges mathematical programming and formal verification. Her most-cited paper, "Solving linear optimization over arithmetic constraint formula" (2017), introduces methods for efficiently optimizing linear objective functions subject to constraints expressed in logical arithmetic forms. This contribution is particularly relevant for applications in automated reasoning, resource allocation, and systems verification, where traditional optimization techniques often fail to handle complex logical structures. While her citation count is modest, Lyu’s work addresses a critical gap in integrating optimization with constraint satisfaction, offering a rigorous framework that can be built upon by future researchers. Her achievements demonstrate a commitment to advancing the theoretical underpinnings of optimization under logical constraints, making her a valuable contributor to the field. For students and researchers exploring the synergy between optimization and logic, Lyu’s research provides a solid foundation for tackling problems where arithmetic and decision-making converge.