Search results for "Minimax"
showing 10 items of 31 documents
A Proximal Solution for a Class of Extended Minimax Location Problem
2005
We propose a proximal approach for solving a wide class of minimax location problems which in particular contains the round trip location problem. We show that a suitable reformulation of the problem allows to construct a Fenchel duality scheme the primal-dual optimality conditions of which can be solved by a proximal algorithm. This approach permits to solve problems for which distances are measured by mixed norms or gauges and to handle a large variety of convex constraints. Several numerical results are presented.
Fast Convergence of Neural Networks by Application of a New Min-Max Algorithm
1992
Abstract The paper presents a new application of the min-max method, an original algorithm previously successfully applied in other areas and based on a combination of the quasi-Newton and steepest descent methods in order to find the weights minimising the error function of a feed forward neural networks. Preliminary results, obtained by applying the proposed method to a simple 2-2-1 architecture on small Boolean learning problems, are very promising.
The price of multiobjective robustness : Analyzing solution sets to uncertain multiobjective problems
2021
Defining and finding robust efficient solutions to uncertain multiobjective optimization problems has been an issue of growing interest recently. Different concepts have been published defining what a “robust efficient” solution is. Each of these concepts leads to a different set of solutions, but it is difficult to visualize and understand the differences between these sets. In this paper we develop an approach for comparing such sets of robust efficient solutions, namely we analyze their outcomes under the nominal scenario and in the worst case using the upper set-less order from set-valued optimization. Analyzing the set of nominal efficient solutions, the set of minmax robust efficient …
Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
2018
As an emerging research field, multiobjective robust optimization employs minmax robustness as the most commonly used concept. Light robustness is a concept in which a parameter, tolerable degradations, can be used to control the loss in the objective function values in the most typical scenario for gaining in robustness. In this paper, we develop a lightly robust interactive multiobjective optimization method, LiRoMo, to support a decision maker to find a most preferred lightly robust efficient solution with a good balance between robustness and the objective function values in the most typical scenario. In LiRoMo, we formulate a lightly robust subproblem utilizing an achievement scalarizi…
Groups with soluble minimax conjugate classes of subgroups
2008
A classical result of Neumann characterizes the groups in which each subgroup has finitely many conjugates only as central-by-finite groups. If $\mathfrak{X}$ is a class of groups, a group $G$ is said to have $\mathfrak{X}$-conjugate classes of subgroups if $G/core_G(N_G(H)) \in \mathfrak{X}$ for each subgroup $H$ of $G$. Here we study groups which have soluble minimax conjugate classes of subgroups, giving a description in terms of $G/Z(G)$. We also characterize $FC$-groups which have soluble minimax conjugate classes of subgroups.
Computing continuous numerical solutions of matrix differential equations
1995
Abstract In this paper, we construct analytical approximate solutions of initial value problems for the matrix differential equation X ′( t ) = A ( t ) X ( t ) + X ( t ) B ( t ) + L ( t ), with twice continuously differentiable functions A ( t ), B ( t ), and L ( t ), continuous. We determine, in terms of the data, the existence interval of the problem. Given an admissible error e, we construct an approximate solution whose error is smaller than e uniformly, in all the domain.
ChemInform Abstract: LOCATION OF TRANSITION STATES AND STABLE INTERMEDIATES BY MINIMAX/MINIMI OPTIMIZATION OF SYNCHRONOUS TRANSIT PATHWAYS
1983
The MINIMAX/MINIMI concept for the location of transition states and/or stable intermediates of chemical reactions is introduced, based on the synchronous transit method. According to this strategy, minimization of quadratic synchronous transit path maxima or minima is achieved by constrained exhaustive optimization of internal coordinates. The method and its efficiency are demonstrated for two-dimensional model surfaces as well as for thermally allowed electrocyclic interconversions of cyclopropyl-/allyl-cation and cyclobutene-/butadiene (gauche) within the framework of MNDO-SCF calculations. Thus, in both cases a direct comparison with the exact solution determined by minimization of the …
Fair Transfer Prices of Global Supply Chains in the Process Industry
2016
This work addresses the optimisation of transfer prices for the fair profit distribution among the members involved in a global supply chain in the process industry. A mixed integer linear programming (MILP) model is developed for production and distribution planning of global supply chains, where the optimal transfer prices of products between plants and markets are determined. Two solution approaches are presented for fair solutions using Nash and lexicographic maximin principles. The applicability of the proposed models and approaches are demonstrated by an illustrative example. The results show that both approaches can fairly distribute the whole supply chain’s profit to the members.
Fair Executive Compensation: Is Kalai-Smorodinsky More Just than Nash ?
2015
By considering Phelps' curve, the best disagreement point (BATNA) and the gains of negotiation, we examine what a fair distribution of executive wages should be. Beyond equality and Rawls' maximin, we focus on equality-of-gains (Nash) and on relative-equality-of-gains (Kalai-Smorodinsky). Equality-of-gains is close to maximin; executives may not accept to bargain. Relative-equality-of-gains allows executives and workers to obtain equal gains in percentage; executive compensation is not intolerably high to the price of a higher total payroll.
On $MC$-hypercentral triply factorized groups
2007
A group G is called triply factorized in the product of two subgroups A, B and a normal subgroup K of G ,i fG = AB = AK = BK. This decomposition of G has been studied by several authors, investigating on those properties which can be carried from A, B and K to G .I t is known that if A, B and K are FC-groups and K has restrictions on the rank, then G is again an FC-group. The present paper extends this result to wider classes of FC-groups. Mathematics Subject Classification: 20F24; 20F14