Lexicographic optimization is a kind of Multi-objective optimization. In general, multi-objective optimization deals with optimization problems with two...

Lexicographic max-min optimization (also called lexmaxmin or leximin or leximax or lexicographic max-ordering optimization) is a kind of multi-objective...

Multi-objective optimization or Pareto optimization (also known as multi-objective programming, vector optimization, multicriteria optimization, or multiattribute...

The maximum x can be found by solving a linear program; see Lexicographic max-min optimization. Alternatively, the DRF can be computed sequentially.: Algorithm...

nucleolus of a general game can be computed by any algorithm for lexicographic max-min optimization. These algorithms usually require to solve linear programs...

and subject to that the second-maximum load, etc. (using lexicographic max-min optimization). Leximin-Phragmen: Maximizing the minimum load, and subject...

the leximin order.: 34  The same is true for the lexicographic order. Lexicographic max-min optimization is the computational problem of finding a maximal...

Combinatorial Optimization – Theory, Methodology, and Applications". In Ehrgott, Matthias; Gandibleux, Xavier (eds.). Multiple Criteria Optimization: State of...

that is, it solves the following optimization problem: max x ∈ X min i ∈ I u i ( x ) . {\displaystyle \max _{x\in X}\min _{i\in I}u_{i}(x).} Often, there...

point search: an optimization to A* which may reduce computation time by an order of magnitude using further heuristics Lexicographic breadth-first search...

equilibrium': P o A = max s ∈ S Welf ⁡ ( s ) min s ∈ E q u i l Welf ⁡ ( s ) {\displaystyle PoA={\frac {\max _{s\in S}\operatorname {Welf} (s)}{\min _{s\in Equil}\operatorname...

= 1 − λ max ( W ) λ min ( W ) {\displaystyle \chi _{W}(G)=1-{\tfrac {\lambda _{\max }(W)}{\lambda _{\min }(W)}}} , where λ max ( W ) , λ min ( W ) {\displaystyle...

this two variable example, the monomial ordering that is used is the lexicographic order with x > y , {\displaystyle x>y,} and we consider the reduction...

a string can be computed by simply trying every halting program, in lexicographic order, until one of them outputs the string. The other direction is...

each case the pair ( m , n ) {\displaystyle (m,n)} decreases in the lexicographic order on pairs, which is a well-ordering, just like the ordering of...

symmetric binary B-tree symmetric set difference symmetry breaking symmetric min max heap tail tail recursion tango tree target temporal logic terminal (see...

the “14th Five-Year Plan for Ecological Space Construction and Amenity Optimization in Shanghai”] (PDF) (in Chinese). Shanghai Landscaping & City Appearance...

value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. The node at the "top" of the heap...

their usual order form an unbounded lattice, under the operations of "min" and "max". 1 is bottom; there is no top (see Pic. 4). The Cartesian square of...

_{i}(t)} and has been used in quadratic optimization of stock portfolios, a special case of which is optimization with respect to the logarithmic utility...