A method for finding common set of weights by multiple objective programming in data envelopment analysis.
A method for sensor placement taking into account diagnosability criteria
This paper presents a new approach to sensor placement based on diagnosability criteria. It is based on the study of structural matrices. Properties of structural matrices regarding detectability, discriminability and diagnosability are established in order to be used by sensor placement methods. The proposed approach manages any number of constraints modelled by linear or nonlinear equations and it does not require the design of analytical redundancy relations. Assuming that a constraint models...
A method of approximating Pareto sets for assessments of implicit Pareto set elements
A method of multiobjective decision making using a vector value function.
A decision situation with partial information on preferences by means of a vector value function is assumed. The concept of minimum value dispersion solution as a reference point joined with a pseudodistance function from such a point and a dispersion level ε, lead to the notion of ε-dispersion set. The dispersion level represents the amount of value that the decision maker can be indifferent to, therefore he should choose his most preferred solution in this set. Convergence properties, as well...
A method of reduction of constraints
A Methodology for Business Process Modelling
A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem
In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time....
A model and an algorithm for the grouping problem in telecom networks.
This paper deals with the so called grouping problem which arises in telecommunication network optimization when transmission equipment with a certain hierarchy is used. It is shown how this problem is embedded in the complete scheme of network optimization and a general combinatorial model is developed to derive afterwards a solution procedure. The implementation of this procedure forms part of a software tool for the complete problem of transmission network planning. Some results deriving from...
A model for a dynamic preventive maintenance policy.
A model for opinion agreement and confidence in multi-expert multi-criteria decisión making.
In multi-expert multi-criteria decision making problems, we often have to deal with different opinions, different importance of criteria and experts, missing data, unexpressed opinions and experts who are not fully confident with their judgment. All these factors make the problem more difficult to solve, and run the risk of making the model logic less transparent. In this paper, we present a model based on simple assumptions described by logical rules, in order to maintain the model transparency...
A Modification of Revised Simplex Method
A modified algorithm for the strict feasibility problem
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
A modified algorithm for the strict feasibility problem
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
A modified Bregman proximal scheme to minimize the difference of two convex functions.
A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics
Our aim is to adapt Fletcher's filter approach to solve optimal control problems for systems described by nonlinear Partial Differential Equations (PDEs) with state constraints. To this end, we propose a number of modifications of the filter approach, which are well suited for our purposes. Then, we discuss possible ways of cooperation between the filter method and a PDE solver, and one of them is selected and tested.
A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea
A modification of the limited-memory variable metric BNS method for large scale unconstrained optimization of the differentiable function is considered, which consists in corrections (based on the idea of conjugate directions) of difference vectors for better satisfaction of the previous quasi-Newton conditions. In comparison with [11], more previous iterations can be utilized here. For quadratic objective functions, the improvement of convergence is the best one in some sense, all stored corrected...
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 Modified Step-Length Algorithm in Nonlinear Programming
A Moreau-Yosida regularization of a difference of two convex functions.
A Multi –Step Curve Search Algorithm in Nonlinear Optimization