Use of the interior-point method for correcting and solving inconsistent linear inequality systems.
Popescu, Elena (2001)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Popescu, Elena (2001)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
Adlakha, V., Arsham, H. (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Margita Kon-Popovska (2003)
The Yugoslav Journal of Operations Research
Similarity:
A. I. Kouada (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Minoux (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Popescu, Elena (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Maria De Giuli, Giorgio Giorgi (2010)
Control and Cybernetics
Similarity:
Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi (2007)
RAIRO - Operations Research
Similarity:
This paper presents a feasible primal algorithm for linear semidefinite programming. The algorithm starts with a strictly feasible solution, but in case where no such a solution is known, an application of the algorithm to an associate problem allows to obtain one. Finally, we present some numerical experiments which show that the algorithm works properly.
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
Szabó, Zsuzsanna, Kovács, Márta (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Laureano F. Escudero (1981)
Qüestiió
Similarity:
The Generator Maintenance and Operation Scheduling problem is presented as large-scale mixed integer non-linear programming case. Several relaxations of the integrality condition on the variables are discussed. The optimal solution of the model based on these relaxations is viewed as the lower bound of the optimal solution in the original problem. A continuous constrained non-linear programming algorithm is used in the optimization of the relaxed formulation. Computational experience...