This is an outdated version published on 2024-11-26. Read the most recent version.
Preprint / Version 3

Linear programming with vector coefficients in the constraints

##article.authors##

  • Somdeb Lahiri (Formerly) PD Energy University (EU-G)

DOI:

https://doi.org/10.31224/4135

Keywords:

linear programming, vector coefficients, duality theory, Farkas’ lemma

Abstract

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 2024-11-26

Versions

License

Copyright (c) 2024 Somdeb Lahiri

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Version justification

The "not so good" example has been removed. Some typos have been corrected.