Preprint / Version 1

Lexicographic and Lexicographic Egalitarian Bi-Objective Linear Programming

##article.authors##

DOI:

https://doi.org/10.31224/8599

Keywords:

linear programming, lexicographic, lexicographic egalitarian, weighted average

Abstract

We show that the set of solutions of a lexicographic bi-objective linear programming problem is equal to the set of solutions of a linear programming problem with the same constraints and whose objective function is a non-negative and non-zero weighted sum of the two objective functions. We also show that the set of solutions of a lexicographic egalitarian bi-objective linear programming problem is equal to the set of solutions of a linear programming problem with the same constraints and whose objective function is a non-negative and non-zero weighted sum of the minimum and maximum of the two objective functions.

Downloads

Download data is not yet available.

Author Biography

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

I retired on superannuation as Professor of Economics from PD Energy University (PDEU) on June 5, 2022.

Downloads

Posted

2026-10-25

License

Copyright (c) 2026 Somdeb Lahiri

Creative Commons License

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