IEEE

Extension of Duality Results and a Dual Simplex Method for Linear Programming Problems With Intuitionistic Fuzzy Variables

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 ...
Scientific Research Publishing

F. Glover, “Improved Linear Integer Programming Formulations of Nonlinear Integer Problems,” Management Science, Vol. 22, No. 4, 1975, pp. 455-460. doi:10.1287/mnsc.22.4.455

ABSTRACT: In this paper a new approach for obtaining an approximation global optimum solution of zero-one nonlinear programming (0-1 NP) problem which we call it Parametric Linearization Approach (P.L ...
JSTOR Daily

Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems

Transportation Science, Vol. 38, No. 3 (August 2004), pp. 343-356 (14 pages) Bounds and approximate formulae are developed for the average optimum distance of the transportation linear programming ...
JSTOR Daily

Unboundedness in Integer and Discrete Programming L.P. Relaxations

https://doi.org/10.2307/3009435 • https://www.jstor.org/stable/3009435 Copy URL Commercial branch and bound codes for solving the general mixed integer linear ...