A density result in vector optimization.
A few remarks on vector optimization from the coalition-game theoretical point-of-view
A generic result in vector optimization.
A goal programming model for selecting a facility location site
A good approximation of the inventory level in a perishable inventory system
A good approximation of the inventory level in a (Q, r) perishable inventory system
This paper derives a good approach to approximating the expected inventory level per unit time for the continuous review (Q, r) perishable inventory system. Three existing approximation approaches are examined and compared with the proposed approach. Three stockout cases, including the full backorder, the partial backorder, and the full lost sales cases, which customers or material users generally use to respond to a stockout condition are considered. This study reveals the fact that the...
A modified standard embedding for linear complementarity problems
We propose a modified standard embedding for solving the linear complementarity problem (LCP). This embedding is a special one-parametric optimization problem . Under the conditions (A3) (the Mangasarian–Fromovitz Constraint Qualification is satisfied for the feasible set depending on the parameter ), (A4) ( is Jongen–Jonker– Twilt regular) and two technical assumptions, (A1) and (A2), there exists a path in the set of stationary points connecting the chosen starting point for with a certain...
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
In this paper, we propose a large-update primal-dual interior point algorithm for linear optimization. The method is based on a new class of kernel functions which differs from the existing kernel functions in which it has a double barrier term. The investigation according to it yields the best known iteration bound for large-update algorithm with the special choice of its parameter and thus improves the iteration bound obtained in Bai et al. [El Ghami2004] for large-update algorithm.
A new regular multiplier embedding
Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions for its convergence...
A new type of stable generalized convex functions.
A note of stability of weakly efficient solution set for optimization with set-valued maps.
A note on approximate solutions in parametric semi-infinite optimization
A Note on Embeddings for the Augmented Lagrange Method
A note on the relation between strong and M-stationarity for a class of mathematical programs with equilibrium constraints
In this paper, we deal with strong stationarity conditions for mathematical programs with equilibrium constraints (MPEC). The main task in deriving these conditions consists in calculating the Fréchet normal cone to the graph of the solution mapping associated with the underlying generalized equation of the MPEC. We derive an inner approximation to this cone, which is exact under an additional assumption. Even if the latter fails to hold, the inner approximation can be used to check strong stationarity...
A parametric study for solving nonlinear fractional problems.
A porosity result in convex minimization.
A remark on sensitivity in linear programming and Gale-Samuelson nonsubstitution theorem
A sensitivity result for quadratic second-order cone programming and its application
In this paper, we present a sensitivity result for quadratic second-order cone programming under the weak form of second-order sufficient condition. Based on this result, we analyze the local convergence of an SQP-type method for nonlinear second-order cone programming. The subproblems of this method at each iteration are quadratic second-order cone programming problems. Compared with the local convergence analysis done before, we do not need the assumption that the Hessian matrix of the Lagrangian...
A short note on marginal analysis of a transportation problem (Retraction article)
Editorial from the Editor-in-Chief regarding this case of plagiarismPhilippe Mahey 1 Introduction Plagiarism is a plague that any scientific publication in any discipline should fight and eradicate all over the world. Unfortunately, if, on the one hand, the powerful search engines available on the web have helped referees to identify most of the cases, the increasing number of publications have on the other hand facilitated that dubious practice and the number of cases have increased. The case...
A simple proof of the minimax-theorem