Displaying similar documents to “Interactive multi-objective optimization for simulated moving bed processes”

A second order η -approximation method for constrained optimization problems involving second order invex functions

Tadeusz Antczak (2009)

Applications of Mathematics

Similarity:

A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order η -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order η -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between...

Multiobjective De Novo Linear Programming

Petr Fiala (2011)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

Mathematical programming under multiple objectives has emerged as a powerful tool to assist in the process of searching for decisions which best satisfy a multitude of conflicting objectives. In multiobjective linear programming problems it is usually impossible to optimize all objectives in a given system. Trade-offs are properties of inadequately designed system a thus can be eliminated through designing better one. Multiobjective De Novo linear programming is problem for designing...

Robust real-time optimization for the linear oil blending

Stefan Janaqi, Jorge Aguilera, Meriam Chèbre (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we present a robust real-time optimization method for the online linear oil blending process. The blending process consists in determining the optimal mix of components so that the final product satisfies a set of specifications. We examine different sources of uncertainty inherent to the blending process and show how to address this uncertainty applying the Robust Optimization techniques. The polytopal structure of our problem permits a simplified robust approach. Our...

Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming

John Sylva, Alejandro Crema (2008)

RAIRO - Operations Research

Similarity:

An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.