On Finite Termination in the Primal-Dual Method for Linear Programming
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
Hongwei Jiao, Sanyang Liu, Jingben Yin, Yingfeng Zhao (2016)
Open Mathematics
Similarity:
Many algorithms for globally solving sum of affine ratios problem (SAR) are based on equivalent problem and branch-and-bound framework. Since the exhaustiveness of branching rule leads to a significant increase in the computational burden for solving the equivalent problem. In this study, a new range reduction method for outcome space of the denominator is presented for globally solving the sum of affine ratios problem (SAR). The proposed range reduction method offers a possibility to...
Christoph Bandt, Mathias Mesing (2009)
Banach Center Publications
Similarity:
In the class of self-affine sets on ℝⁿ we study a subclass for which the geometry is rather tractable. A type is a standardized position of two intersecting pieces. For a self-affine tiling, this can be identified with an edge or vertex type. We assume that the number of types is finite. We study the topology of such fractals and their boundary sets, and we show how new finite type fractals can be constructed. For finite type self-affine tiles in the plane we give an algorithm which...
Paweł Urbański (2003)
Banach Center Publications
Similarity:
An affine Cartan calculus is developed. The concepts of special affine bundles and special affine duality are introduced. The canonical isomorphisms, fundamental for Lagrangian and Hamiltonian formulations of the dynamics in the affine setting are proved.
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Similarity:
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.
Richard Andrášik (2013)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Nonlinear rescaling is a tool for solving large-scale nonlinear programming problems. The primal-dual nonlinear rescaling method was used to solve two quadratic programming problems with quadratic constraints. Based on the performance of primal-dual nonlinear rescaling method on testing problems, the conclusions about setting up the parameters are made. Next, the connection between nonlinear rescaling methods and self-concordant functions is discussed and modified logarithmic barrier...
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Nebojša Stojković, Predrag Stanimirović (2002)
Matematički Vesnik
Similarity:
Kojima, Masakazu, Megiddo, Nimrod, Mizuno, Shinji (1998)
Journal of Inequalities and Applications [electronic only]
Similarity:
J. Gondzio, D. Tachat (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Józef Joachim Telega (1977)
Annales Polonici Mathematici
Similarity:
Kutateladze, S.S. (2007)
Sibirskij Matematicheskij Zhurnal
Similarity: