Support-type properties of generalized convex functions

Chebyshev systems induce in a natural way a concept of convexity. The functions convex in this sense behave in many aspects similarly to ordinary convex functions. In this paper support-type properties are investigated. Using osculatory interpolation, the existence of support-like functions is established for functions convex with respect to Chebyshev systems. Unique supports are determined. A characterization of the generalized convexity via support properties is presented.     

Note on generalized convex functions

In this note, an important class of generalized convex functions, called invex functions, is defined under a general framework, and some properties of the functions in this class are derived. It is also shown that a function is (generalized) pseudoconvex if and only if it is quasiconvex and invex.     

Optimality and duality with generalized convexity

Hanson and Mond have given sets of necessary and sufficient conditions for optimality and duality in constrained optimization by introducing classes of generalized convex functions, called type I and type II functions. Recently, Bector defined univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, optimality and duality results for several mathematical programs are obtained combining the concepts of type I and univex functions. Examples of functions satisfying these conditions are given.     

A branch and bound algorithm for the generalized assignment problem

This paper describes what is termed the generalized assignment problem. It is a generalization of the ordinary assignment problem of linear programming in which multiple assignments of tasks to agents are limited by some resource available to the agents. A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds. Computational results are cited for problems with up to 4 000 0–1 variables, and comparisons are made with other algorithms.This research was partly supported by ONR Contracts N00014-67-A-0126-0008 and N00014-67-A-0126-0009 with the Center for Cybernetic Studies, The University of Texas.     

Some properties of certain subclasses of analytic functions with negative coefficients by using generalized ruscheweyh derivative operator

By making use of the known concept of neighborhoods of analytic functions we prove several inclusions associated with the (j, δ)-neighborhoods of various subclasses of starlike and convex functions of complex order b which are defined by the generalized Ruscheweyh derivative operator. Further, partial sums and integral means inequalities for these function classes are studied. Relevant connections with some other recent investigations are also pointed out.     

Confidence structures in decision making

Decision making is defined in terms of four elements: the set of decisions, the set of outcomes for each decision, a set-valued criterion function, and the decision maker's value judgment for each outcome. Various confidence structures are defined, which give the decision maker's confidence of a given decision leading to a particular outcome. The relation of certain confidence structures to Bayesian decision making and to membership functions in fuzzy set theory is established. A number of schemes are discussed for arriving atbest decisions, and some new types of domination structures are introduced.This research was partly supported by Project No. NR-047-021, ONR Contract No. N-00014-75-C-0569 with the Center for Cybernetic Studies, The University of Texas, Austin, Texas, and by ONR Contract No. N-00014-69-A-0200-1012 with the University of California, Berkeley, California.     

Characterization of optimality in convex programming without a constraint qualification

Necessary and sufficient conditions of optimality are given for convex programming problems with no constraint qualification. The optimality conditions are stated in terms of consistency or inconsistency of a family of systems of linear inequalities and cone relations.This research was supported by Project No. NR-047-021, ONR Contract No. N00014-67-A-0126-0009 with the Center for Cybernetics Studies, The University of Texas; by NSF Grant No. ENG-76-10260 at Northwestern University; and by the National Research Council of Canada.     

On stability of solutions to parametric generalized affine variational inequalities

This paper deals with the stability of the solution set to parametric generalized affine variational inequalities with constraint set being defined by finitely many convex quadratic functions. The obtained results develop and complement the published ones.     

On generalized trade-off directions in nonconvex multiobjective optimization

Trade-off information related to Pareto optimal solutions is important in multiobjective optimization problems with conflicting objectives. Recently, the concept of trade-off directions has been introduced for convex problems. These trade-offs are characterized with the help of tangent cones. Generalized trade-off directions for nonconvex problems can be defined by replacing convex tangent cones with nonconvex contingent cones. Here we study how the convex concepts and results can be generalized into a nonconvex case. Giving up convexity naturally means that we need local instead of global analysis. Received: December 2000 / Accepted: October 2001?Published online February 14, 2002     

The generalization of the generalized Al-Oboudi differential operator

In this paper, firstly we define the generalization of the generalized Al-Oboudi differential operator. Then we also define new classes of analytic and p-valently starlike and convex functions with complex order by means of this new general differential operator. Our main purpose is to determine coefficient bounds for functions in certain subclasses of this classes, which are introduced here by means of a family of nonhomogeneous Cauchy-Euler differential equations. Relevant connections of some of the results obtained with those in earlier works are also provided.     

Properties of functions generalized convex with respect to a WT-system

Continuity and convergence properties of functions, generalized convex with respect to a continuous weak Tchebysheff system, are investigated. It is shown that, under certain non-degeneracy assumptions on the weak Tchebysheff system, every function in its generalized convex cone is continuous, and pointwise convergent sequences of generalized convex functions are uniformly convergent on compact subsets of the domain. Further, it is proved that, with respect to a continuous Tchebysheff system, L_p-convergence to a continuous function, pointwise convergence and uniform convergence of a sequence of generalized convex functions are equivalent on compact subsets of the domain.     

Affine minorants minimizing the sum of convex functions

It is often possible to replace a convex minimization problem by an equivalent one, in which each of the original convex functions is replaced by a suitably chosen affine minorant. In this paper we identify essentially the minimal conditions permitting this replacement, and also shed light on the close and complete link between such optimal affine minorants and certain optimal dual vectors. An application to the ordinary convex programming problem is included.This research was supported in part by the National Science Foundation, Grant No. MPS75-08025, at the University of Illinois at Urbana-Champaign.     

A note on a generalized network flow model for manufacturing process

Manufacturing network flow （MNF） is a generalized network model that overcomes the limitation of an ordinary network flow in modeling more complicated manufacturing scenarios, in particular the synthesis of different materials into one product and/or the distilling of one type of material into many different products. Though a network simplex method for solving a simplified version of MNF has been outlined in the literature, more research work is still needed to give a complete answer whether some classical duality and optimality results of the classical network flow problem can be extended in MNF. In this paper, we propose an algorithmic method for obtaining an initial basic feasible solution to start the existing network simplex algorithm, and present a network-based approach to checking the dual feasibility conditions. These results are an extension of those of the ordinary network flow problem.     

On A characterization of optimality in convex programming

Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.This research was partly supported by Project No. NR 047-02, ONR Contracts N00014-67-A-0126-0008 and N00014-67-A-0126-0009 with the Center for Cybernetic Studies, The University of Texas.     

A note on three-parameter families and generalized convex functions

The concept of generalized convex functions introduced by Beckenbach [E.F. Beckenbach, Generalized convex functions, Bull. Amer. Math. Soc. 43 (1937) 363–371] is extended to the two-dimensional case. Using three-parameter families, we define generalized convex (midconvex, M-convex) functions and show some continuity properties of them.     

Derivatives of generalized farthest functions and existence of generalized farthest points

The relationship between directional derivatives of generalized farthest functions and the existence of generalized farthest points in Banach spaces is investigated. It is proved that the generalized farthest function generated by a bounded closed set having a one-sided directional derivative equal to 1 or −1 implies the existence of generalized farthest points. New characterization theorems of (compact) locally uniformly convex sets are given.     

A characterization of generalized poles of generalized Nevanlinna functions

Generalized poles of a generalized Nevanlinna function Q ∈ ??_κ (??) are defined in terms of the operator representation of Q . In this paper those generalized poles that are not of positive type and their degrees of non‐positivity are characterized analytically by means of pole cancellation functions. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On exact solutions for some oscillating motions of a generalized Oldroyd-B fluid

This paper deals with exact solutions for some oscillating motions of a generalized Oldroyd-B fluid. The fractional calculus approach is used in the constitutive relationship of fluid model. Analytical expressions for the velocity field and the corresponding shear stress for flows due to oscillations of an infinite flat plate as well as those induced by an oscillating pressure gradient are determined using Fourier sine and Laplace transforms. The obtained solutions are presented under integral and series forms in terms of the Mittag–Leffler functions. For α = β = 1, our solutions tend to the similar solutions for ordinary Oldroyd-B fluid. A comparison between generalized and ordinary Oldroyd-B fluids is shown by means of graphical illustrations.     

On the concept of generalized solution of operator equations in banach spaces

We introduce a new concept of generalized solution of operator equations with closed linear operator in a Banach space as an element of the completion of the space in certain locally convex topology. We prove a theorem on the existence and uniqueness of a generalized solution and give examples of finding the generalized solution for infinite systems of the linear algebraic equations. Kiev University, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 48, No. 9. pp. 1286–1290, September, 1996.     

On exact solutions for some oscillating motions of a generalized Oldroyd-B fluid

This paper deals with exact solutions for some oscillating motions of a generalized Oldroyd-B fluid. The fractional calculus approach is used in the constitutive relationship of fluid model. Analytical expressions for the velocity field and the corresponding shear stress for flows due to oscillations of an infinite flat plate as well as those induced by an oscillating pressure gradient are determined using Fourier sine and Laplace transforms. The obtained solutions are presented under integral and series forms in terms of the Mittag–Leffler functions. For α = β = 1, our solutions tend to the similar solutions for ordinary Oldroyd-B fluid. A comparison between generalized and ordinary Oldroyd-B fluids is shown by means of graphical illustrations.