The homogeneous and self - dual model and algorithm for linear optimization
نویسنده
چکیده
instead of (1). Clearly, (3) is a homogeneous LP and is self-dual which essentially follows from the constraints form a skew-symmetric system. The interpretation of (3) is τ is a homogenizing variable and the constraints represent primal feasibility, dual feasibility, and reversed weak duality. The homogeneous model (3) was first studied by Goldman and Tucker [2] in 1956 and they proved (3) always has a nontrivial solution (x∗, y∗, τ∗) satisfying xjs ∗ j = 0, x ∗ j + s ∗ j > 0, ∀j, τ∗κ∗ = 0, τ∗ + κ∗ > 0, (4)
منابع مشابه
An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملReal-Time Optimization for Economic Model Predictive Control
In this paper, we develop an efficient homogeneous and self-dual interior-point method for the linear programs arising in economic model predictive control. To exploit structure in the optimization problems, the algorithm employs a highly specialized Riccati iteration procedure. Simulations show that in comparison to conventional interior-point methods, our solver is a) significantly faster per...
متن کاملPrimal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملOn two homogeneous self-dual systems for linear programming and its extensions
We investigate the relation between interior-point algorithms applied to two homogeneous self-dual approaches to linear programming, one of which was proposed by Ye, Todd, and Mizuno and the other by Nesterov, Todd, and Ye. We obtain only a partial equivalence of path-following methods (the centering parameter for the first approach needs to be equal to zero or larger than one half), whereas co...
متن کاملAn Integrated Model for Storage Location Assignment and Storage/Retrieval Scheduling in AS/RS system
An integrated optimization framework, including location assignment under grouping class-based storage policy and schedule of dual shuttle cranes, is offered by presenting a new optimization programming model. The objective functions, which are considered at this level, are the minimization of total costs and energy consumption. Scheduling of dual shuttle cranes among specified locations, which...
متن کامل