Isospectral flows and linear programming

1993 ◽  
Vol 34 (4) ◽  
pp. 495-510
Author(s):  
U. Helmke
Keyword(s):  
Linear Programming ◽  
Interior Point ◽  
Continuous Time ◽  
Compact Convex ◽  
Optimal Solution ◽  
Symmetric Matrices ◽  
Interior Point Algorithm ◽  
Convex Constraints ◽  
Linear Programming Problems ◽  
Karmarkar Algorithm

AbstractBrockett has studied the isospectral flow Ḣ = [H, [H, N]], with [A, B] = AB ∔ BA, on spaces of real symmetric matrices. The flow diagonalises real symmetric matrices and can be used to solve linear programming problems with compact convex constraints. We show that the flow converges exponentially fast to the optimal solution of the programming problem and we give explicit estimates for the time needed by the flow to approach an ε-neighbourhood of the optimum. An interior point algorithm for the standard simplex is analysed in detail and a comparison is made with a continuous time version of Karmarkar algorithm.

scholarly journals Numerical Method for Solving the Robust Continuous-Time Linear Programming Problems

Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 435
Author(s):  
Hsien-Chung Wu
Keyword(s):  
Linear Programming ◽  
Robust Optimization ◽  
Numerical Method ◽  
Programming Problem ◽  
Continuous Time ◽  
Linear Programming Problem ◽  
Optimal Solution ◽  
Robust Counterpart ◽  
Linear Programming Problems ◽  
Time Linear

A robust continuous-time linear programming problem is formulated and solved numerically in this paper. The data occurring in the continuous-time linear programming problem are assumed to be uncertain. In this paper, the uncertainty is treated by following the concept of robust optimization, which has been extensively studied recently. We introduce the robust counterpart of the continuous-time linear programming problem. In order to solve this robust counterpart, a discretization problem is formulated and solved to obtain the ϵ -optimal solution. The important contribution of this paper is to locate the error bound between the optimal solution and ϵ -optimal solution.

scholarly journals Ranking Function Application for Optimal Solution of Fractional programming problem

2020 ◽  
Vol 25 (1) ◽  
Author(s):  
Rasha Jalal
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Fractional Programming ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Ranking Function ◽  
Linear Fractional Programming ◽  
Fractional Programming Problem ◽  
Linear Programming Problems

The aim of this paper is to suggest a solution procedure to fractional programming problem based on new ranking function (RF) with triangular fuzzy number (TFN) based on alpha cuts sets of fuzzy numbers. In the present procedure the linear fractional programming (LFP) problems is converted into linear programming problems. We concentrate on linear programming problem problems in which the coefficients of objective function are fuzzy numbers, the right- hand side are fuzzy numbers too, then solving these linear programming problems by using a new ranking function. The obtained linear programming problem can be solved using win QSB program (simplex method) which yields an optimal solution of the linear fractional programming problem. Illustrated examples and comparisons with previous approaches are included to evince the feasibility of the proposed approach.

NEW IMPROVED METHOD FOR SOLVING THE FUZZY LINEAR PROGRAMMING PROBLEMS WITH VARIABLES GIVEN AS FUZZY NUMBERS

2021 ◽  
Vol 10 (12) ◽  
pp. 3699-3723
Author(s):  
L. Kané ◽  
M. Konaté ◽  
L. Diabaté ◽  
M. Diakité ◽  
H. Bado
Keyword(s):  
Linear Programming ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Fuzzy Linear Programming ◽  
Interval Linear Programming ◽  
Interval Numbers ◽  
Programming Technique ◽  
Solution Approach ◽  
Interval Linear ◽  
Linear Programming Problems

The present paper aims to propose an alternative solution approach in obtaining the fuzzy optimal solution to a fuzzy linear programming problem with variables given as fuzzy numbers with minimum uncertainty. In this paper, the fuzzy linear programming problems with variables given as fuzzy numbers is transformed into equivalent interval linear programming problems with variables given as interval numbers. The solutions to these interval linear programming problems with variables given as interval numbers are then obtained with the help of linear programming technique. A set of six random numerical examples has been solved using the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document