Vector Combinatorial Problems in a Space of Combinations with Linear Fractional Functions of Criteria

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

Fractional Integration of the Product of Bessel Functions of the First Kind

Dedicated to 75th birthday of Prof. A.M. Mathai, Mathematical Subject Classification 2010:26A33, 33C10, 33C20, 33C50, 33C60, 26A09

Taylor Spectrum and Characteristic Functions of Commuting 2-Contractions

2000 Mathematics Subject Classification: 47A10, 47A13.

The Deformed Trigonometric Functions of two Variables

MSC 2010: 33B10, 33E20

Subclasses of Starlike Functions of Complex Order Involving Generalized Hypergeometric Functions

MSC2010: 30C45, 33C45