A Note on Embeddings for the Augmented Lagrange Method
A note on essential components and essential weakly efficient solutions for multiobjective optimization problems.
A Note on Geometry of Polyhedron of Three-index Transportation Problem
A note on Gordan's theorem over cone domains.
A note on impulsive control of Feller processes with costly information
The paper deals with the optimal inspections and maintenance problem with costly information for a Markov process with positive discount factor. The associated dynamic programming equation is a quasi-variational inequality with first order differential terms. In this paper we study its different formulations: strong, visousity and evolutionary. The case of impulsive control of purely jump Markov processes is studied as a special case.
A note on minimum-dummy-activities PERT networks
A note on Minty type vector variational inequalities
The existence of solutions to a scalar Minty variational inequality of differential type is usually related to monotonicity property of the primitive function. On the other hand, solutions of the variational inequality are global minimizers for the primitive function. The present paper generalizes these results to vector variational inequalities putting the Increasing Along Rays (IAR) property into the center of the discussion. To achieve that infinite elements in the image space are introduced....
A note on Minty type vector variational inequalities
The existence of solutions to a scalar Minty variational inequality of differential type is usually related to monotonicity property of the primitive function. On the other hand, solutions of the variational inequality are global minimizers for the primitive function. The present paper generalizes these results to vector variational inequalities putting the Increasing Along Rays (IAR) property into the center of the discussion. To achieve that infinite elements in the image space Y are introduced. Under...
A Note on Multi-Criteria Inventory Classification Using Weighted Linear Optimization
A note on necessary conditions in mathematical programming
A note on operators of deletion and contraction for antichains.
A note on optimal inventory policies taking account of time value
A note on optimality conditions for dual problems to the traveling salesman problem
A note on quasiconvex functions that are pseudoconvex.
In the present note we consider the definitions and properties of locally pseudo- and quasiconvex functions and give a sufficient condition for a locally quasiconvex function at a point x ∈ Rn, to be also locally pseudoconvex at the same point.
A note on resolving the inconsistency of one-sided max-plus linear equations
When a system of one-sided max-plus linear equations is inconsistent, its right-hand side vector may be slightly modified to reach a consistent one. It is handled in this note by minimizing the sum of absolute deviations in the right-hand side vector. It turns out that this problem may be reformulated as a mixed integer linear programming problem. Although solving such a problem requires much computational effort, it may propose a solution that just modifies few elements of the right-hand side vector,...
A note on risk averse newsboy problem
A Note on Small Linear-Ordering Polytopes.
A note on some separable location problems - a multicriterial approach
A Note on Spanning Trees for Network Location Problems
A note on the Chvátal-rank of clique family inequalities
Clique family inequalities a∑v∈W xv + (a - 1)∈v∈W, xv ≤ aδ form an intriguing class of valid inequalities for the stable set polytopes of all graphs. We prove firstly that their Chvátal-rank is at most a, which provides an alternative proof for the validity of clique family inequalities, involving only standard rounding arguments. Secondly, we strengthen the upper bound further and discuss consequences regarding the Chvátal-rank of subclasses of claw-free graphs.