In this paper, a new pair of second-order multiobjective symmetric dual programs over arbitrary cones is formulated and appropriate duality theorems are then established under K-η-bonvexity assumptions. We identify a function lying exclusively in the class of K-η-bonvex and not in class of...

Predicted air traffic growth is expected to double the number of flights over the next 20 years. If current means of air traffic control are maintained, airspace capacity will reach its limits. The need for increasing airspace capacity motivates improved aircraft trajectory planning in 4D...

We prove a slightly modified G-Karush-Kuhn-Tucker necessary optimality theorem for multiobjective programming problems, which was originally given by Antczak (J Glob Optim 43:97–109, <CitationRef CitationID="CR2">2009</CitationRef>), and give an example showing the efficient application of (modified) G-Karush-Kuhn-Tucker optimality...</citationref>

Computational Fluids Dynamics (CFD) tools guide engineers and designers to estimate the performance of new designs. However, a CFD analysis can be very time-consuming depending mainly on the grid size and domain complexity. Thus, this paper aims to describe the tools used to evaluate and compare...

In this paper, we introduce an iterative algorithm for finding a common element of the set of solutions of a system of mixed equilibrium problems, the set of solutions of a variational inclusion problems for inverse strongly monotone mappings, the set of common fixed points for nonexpansive...

In this paper, we present a new preference disaggregation method for multiple criteria sorting problems, called DIS-CARD. Real-life experience indicates the need of considering decision making situations in which a decision maker (DM) specifies a desired number of alternatives to be assigned to...

We study a stochastic programming approach to multicriteria multi-period portfolio optimization problem. We use a Single Index Model to estimate the returns of stocks from a market-representative index and a random walk model to generate scenarios on the possible values of the index return. We...

The nonlinear convex programming problem of finding the minimum covering weighted ball of a given finite set of points in <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${\mathbb{R}^n}$$</EquationSource> </InlineEquation> is solved by generating a finite sequence of subsets of the points and by finding the minimum covering weighted ball of each subset in the sequence until...</equationsource></inlineequation>

The support function is strongly related to the cost function in economics. Because the differentiability of the cost function is an important property, being related to the celebrated Shephard’s lemma, our propose is to study the differentiability of the support function of a nonempty closed...

The problem of binary minimization of a quadratic functional in the configuration space is discussed. In order to increase the efficiency of the random-search algorithm it is proposed to change the energy functional by raising to a power the matrix it is based on. We demonstrate that this brings...