Linear Programming

Also known as LP

Overview

Linear programming represents decisions with linear objectives and constraints, making it a basic tool for allocating scarce resources, scheduling, and modeling uncertain or sequential decisions. Work spans exact algorithms such as simplex, interior-point, and primal-dual methods; duality, relaxations, and network-flow structure also provide bounds, integral solutions, and efficient formulations. For online allocation and stochastic optimization, researchers develop pricing, batching, and re-solving methods with regret guarantees, while newer work learns solver parameters, warm starts, or model formulations from data and uses language-model agents with solver checks. Key challenges include scaling to large or changing instances, obtaining guarantees that survive approximation and distribution shift, and balancing learned speedups with exact feasibility and optimality certification.

Latest papers

CardsList

30 papers4 papers in the last four weeks, down 33% on the four weeks before. 0.0% of all new papers.

  1. An Augmented Lagrangian Approach to Lifted Bellman Linear Programming

    Nov 10, 2026Jongchan Park, Hyukjun Yang, Narim Jeong +1Offline RLLinear Programming

  2. Do Language Models Know Which Constraints Belong Together?

    Nov 3, 2026Junbo Jacob Lian, Kaixuan Chen, Hanzhang Qin +3Mixed-Integer Linear ProgrammingLarge Language Model-Guided Optimization

  3. HALO-LP: A Homogeneous All-Shifted Non-Interior-Point Method for Linear Programming

    Oct 31, 2026Jose Rojas, Ana Aguilar, Eusebio BugarinLinear ProgrammingPrimal-Dual Optimization

  4. AHEAD: Adaptive Neural Acceleration for Large-Scale Linear Programming

    Oct 26, 2026Sihao Liu, Zhichao Hou, Huayue Gu +4Learning to OptimizeLinear Programming

  5. Learning Warm Starts for the Simplex Method from Measured Solver Cost

    Oct 14, 2026Felix Parker, Danielle A. Ripsman, Emmett Springer +1Linear ProgrammingLearning to Optimize

  6. Two Linear Programs are Better than One

    Oct 11, 2026Alexander E. Black, Christoph Hertrich, Stefan Kober +1Combinatorial OptimizationLinear Programming

  7. Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes

    Oct 1, 2026Han Zhong, Yinyu YeRobust Markov Decision ProcessesMarkov Decision Processes

  8. The Curvature of Regret in Contextual Linear Optimization

    Oct 1, 2026Konstantinos Ziliaskopoulos, Alexander Vinel, Alice E. SmithDecision-Focused LearningRegret Minimization

  9. Reinforcement Learning to Accelerate Primal-Dual Hybrid Gradient for Linear Programming

    Oct 1, 2026Jinhwan Sul, Alex Oshin, Evangelos A. TheodorouPrimal-Dual OptimizationReinforcement Learning

  10. Predictive Dual Smoothing for Column Generation

    Sep 28, 2026Senne Berden, Noah Schutte, Andrea Lodi +1Primal-Dual OptimizationLinear Programming

  11. An Exact Junction-Tree Extended Formulation for Optimal Classification Trees

    Sep 21, 2026Jiancheng TU, WenqiFanDecision Tree LearningClassification

  12. Fixed-Parameter Tractability of Private Synthetic Data Generation

    Jun 9, 2026Badih Ghazi, Cristóbal Guzmán, Pritish Kamath +3Differentially Private Synthetic Data GenerationSynthetic Data Generation

  13. Tokenisation via Convex Relaxations

    May 21, 2026Jan Tempus, Philip Whittington, Craig W. Schmidt +2Token EfficiencyLinear Programming

  14. Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming

    May 18, 2026Tung Quoc Le, Anh Tuan Nguyen, Viet Anh NguyenMixed-Integer Linear ProgrammingLearning to Optimize

  15. Asymmetric-Information Resource Allocation Games: An LP Approach to Purposeful Deception

    Apr 27, 2026Longxu Pan, Yue Guan, Daigo Shishika +1Imperfect-Information GamesGame Theory

  16. Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation

    Mar 17, 2026Yiming Zong, Jiashuo JiangFunction ApproximationOnline LP

  17. A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming

    Mar 15, 2026Haoran Xu, Owen Shen, Peter Glynn +2Online LPOnline Resource Allocation

  18. OptiRepair: Closed-Loop Diagnosis and Repair of Supply Chain Optimization Models with LLM Agents

    Feb 23, 2026Ruicheng Ao, David Simchi-Levi, Xinshang WangSupply Chain OptimizationLarge Language Model-Guided Optimization

  19. A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention

    Jan 8, 2026Peixin Huang, Yaoxin Wu, Yining Ma +3Graph Neural NetworksMixed-Integer Linear Programming

  20. Infrequent Resolving Algorithm for Online Linear Programming

    Aug 1, 2024Guokai Li, Zizhuo Wang, Jingwei ZhangOnline LPSequential Decision Making

  21. Online Linear Programming with Batching

    Aug 1, 2024Haoran Xu, Peter W. Glynn, Yinyu YeRegret MinimizationSequential Decision Making

  22. OptiMUS-0.3: Using Large Language Models to Model and Solve Optimization Problems at Scale

    Jul 29, 2024Ali AhmadiTeshnizi, Wenzhi Gao, Herman Brunborg +3Mixed-Integer Linear ProgrammingLarge Language Model-Guided Optimization

  23. Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients

    Mar 28, 2024Johannes Müller, Semih Çaycı, Guido MontúfarPolicy GradientOptimization Convergence Analysis

  24. Equity Promotion in Online Resource Allocation

    Dec 8, 2021Pan Xu, Yifan XuSequential Decision MakingFair Resource Allocation