The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining...

A real-valued function f defined on a convex subset D of some normed linear space is said to be inner γ-convex w.r.t. some fixed roughness degree γ    0 if there is a <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$\nu \in]0, 1]$$</EquationSource> </InlineEquation> such that <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$${\rm sup}_{\lambda\in[2,1+1/\nu]} \left(f((1 - \lambda)x_0 + \lambda x_1) - (1 - \lambda) f...</equationsource></inlineequation></equationsource></inlineequation>

The editing-and-imputation problem concerns the question of finding errors in a record which does not satisfy a set of consistency rules. Once some potential errors have been localizated, it is also necessary to impute new values to the associated fields. The output dataset should consist of...

A nonsmooth multiobjective optimization problem involving generalized (F, α, ρ, d)-type I function is considered. Karush–Kuhn–Tucker type necessary and sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Duality results are...

Lehman (Polyhedral combinatorics <Emphasis Type="Bold">1 of DIMACS series in discrete math. and theoretical computer science, pp 101–105, 1990) described some conditions regular minimally nonideal (mni) matrices must satisfy. Although, there are few results on sufficient conditions for mni matrices. In most of...</emphasis>

In this paper we are concerned with the problem of boundedness and the existence of optimal solutions to the constrained integer optimization problem. We present necessary and sufficient conditions for boundedness of either a faithfully convex or quasi-convex polynomial function over the...

In this paper, an Envelope Theorem (ET) will be established for optimization problems on Euclidean spaces. In general, the Envelope Theorems permit analyzing an optimization problem and giving the solution by means of differentiability techniques. The ET will be presented in two versions. One of...

The process of designing new industrial products is in many cases solely based on the intuition and experience of the responsible design engineer. The aid of computers is restricted to visualization and manual manipulation tools. We demonstrate that the design process for conduits, which are...

We introduce the path player game, a noncooperative network game with a continuum of mutually dependent set of strategies. This game models network flows from the point of view of competing network operators. The players are represented by paths in the network. They have to decide how much flow...

An important characteristic of any TCP connection is the sequencing of packets within that connection. Out-of sequence packets indicate that the connection suffers from loss, duplication or reordering. More generally, in many distributed applications information integrity requires that data...