Linear programming with vector coefficients in the constraints
DOI:
https://doi.org/10.31224/4135Keywords:
linear programming, vector coefficients, duality theory, Farkas’ lemmaAbstract
We provide a model of linear programming in which all the parameters of the constraints are vectors. We define the dual of the problem and obtain a necessary and sufficient condition for an optimal solution. We also prove the analogous version of Farkas’ lemma in this more general framework.
Downloads
Download data is not yet available.
Downloads
Posted
2024-11-20 — Updated on 2025-07-05
Versions
- 2025-07-05 (4)
- 2024-11-26 (3)
- 2024-11-22 (2)
- 2024-11-20 (1)
License
Copyright (c) 2024 Somdeb Lahiri

This work is licensed under a Creative Commons Attribution 4.0 International License.
Version justification
A more readable version.