IEEE

On the Difficulty to Beat the First Linear Programming Bound for Binary Codes

Abstract: The first linear programming bound is the best known asymptotic upper bound for binary codes, for a certain subrange of distances. Starting from the work of Friedman and Tillich (2005), ...
SciELO

BRANCH-AND-CUT METHOD FOR SOLVING THE INTEGER LINEAR MULTIPLICATIVE BILEVEL PROBLEM

We study a class of integer bilevel problems, the so-called Integer Linear Multiplicative Bilevel Problem, ILMBP, where the constraints are linear and both the upper level problem and the lower level ...
IEEE

LiP-LLM: Integrating Linear Programming and Dependency Graph With Large Language Models for Multi-Robot Task Planning

Abstract: This study proposes LiP-LLM: integrating linear programming and dependency graph with large language models (LLMs) for multi-robot task planning. For multi-robots to efficiently perform ...
Scientific Research Publishing

Abdullahi, U.A., Suleiman, A. and Suleiman, A. (2017) Comparative Analysis of Simplex Method and the Family of Interior Point Method. IOSR Journal of Mathematics, 13, 11-15.

ABSTRACT: This study presents a modified primal-dual interior point method (MPD-IPM) for solving convex quadratic optimization problems. The modification is performed through linearization of the ...