A continuum of minimal pairs of compact convex sets which are not connected by translations.
A contribution to Balas' algorithm
A contribution to methods of Exterior Penalty Functions for Nonlinear Programming
A convergence proof of a special version of the generalized reduced gradient method (GRGS)
A convergent algorithm for solving linear programs with an additional reverse convex constraint
A cooperative sensor network : optimal deployment and functioning
A network of mobile cooperative sensors is considered. The following problems are studied: (1) the “optimal“deployment of the sensors on a given territory; (2) the detection of local anomalies in the noisy data measured by the sensors. In absence of an information fusion center in the network, from “local” interactions between sensors “global“solutions of these problems are found.
A Cooperative Sensor Network: Optimal Deployment and Functioning
A network of mobile cooperative sensors is considered. The following problems are studied: (1) the “optimal" deployment of the sensors on a given territory; (2) the detection of local anomalies in the noisy data measured by the sensors. In absence of an information fusion center in the network, from “local" interactions between sensors “global" solutions of these problems are found.
A Counterexample to Greenberg's Algorithm for Solving Linear Inequalities.
A Cyclic Projection Algorithm Via Duality.
A DEA model for two-stage parallel-series production processes
Data envelopment analysis (DEA) has been widely used to measure the performance of the operational units that convert multiple inputs into multiple outputs. In many real world scenarios, there are systems that have a two-stage network process with shared inputs used in both stages of productions. In this paper, the problem of evaluating the efficiency of a set of specialized and interdependent components that make up a large DMU is considered. In these processes the first stage consists of two parallel...
A Decision Support System for Farm Regional Planning
A decision support system for regional hazardous waste management alternatives.
A decomposition heuristic for the maximal covering location problem.
A Decomposition of 2-Weak Vertex-Packing Polytopes.
A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery.
A Decomposition-Dualization Approach for Solving Constraint Convex Minimization Problems with Applications to Discretized Obstacle Problems.
A density result in vector optimization.
A derivation of Lovász’ theta via augmented Lagrange duality
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász number.
A Derivation of Lovász' Theta via Augmented Lagrange Duality
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász θ number.
A diffusion approximation in the ruin problem for a controlled Markov chain