ABSTRACT: Most of the current methods for solving linear fractional programming (LFP) problems depend on the simplex type method. In this paper, we present a new approach for solving linear fractional ...

This paper addresses the issue of which strong duality holds between parametric robust semi-definite linear optimization problems and their dual programs. In the case of a spectral norm uncertainty ...

This paper presents the basic concepts of linear programming, which consists in minimizing or maximizing a linear objective function with linear inequality or equality constraints on the variables of ...

Abstract: The aim of this paper is to introduce a formulation of linear programming problems involving intuitionistic fuzzy variables. Here, we will focus on duality and a simplex-based algorithm for ...

Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...

ABSTRACT: Most of the current methods for solving linear fractional programming (LFP) problems depend on the simplex type method. In this paper, we present a new approach for solving linear fractional ...