Constraint qualifications in convex vector semi-infinite optimization

Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimization of finitely many convex scalar functions subject to infinitely many convex constraints. This paper provides characterizations of the weakly efficient, efficient and properly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The results in this paper generalize those obtained by the same authors on linear vector semi-infinite optimization problems.

Bertrand Competition with an Asymmetric No-discrimination Constraint. Bruges European Economic Research (BEER) 23/June 2012

Regulators and competition authorities often prevent firms with significant market power or dominant firms from practicing price discrimination. The goal of such an asymmetric no- discrimination constraint is to encourage entry and serve consumers’ interests. This constraint prohibits the firm with significant market power to practice both behaviour-based price discrimination within the competitive segment and third-degree price discrimination across the monopolistic and competitive segments. We find that this constraint hinders entry and reduces welfare when the monopolistic segment is small.

Efficient algorithms for solving systems of ordinary differential equations for ecosystems modeling /

Mode of access: Internet.

Using analysis for problem solving : a guidebook for law enforcement /

"Created date: September 14, 2001"--P. [4] of cover.

A computer research program for solving the reaction rate equations in the E ionospheric region /

Ionospheric Physics Laboratory Project 8653.

Solving public passenger transportation problems: a need for policy reorientation. Final report. Volume II.

Transportation Department, Office of University Research, Washington, D.C.

An algorithm for solving linear recurrence systems on parallel and pipelined machines /

"UILU-ENG 78 1745."

Iterative and direct methods for solving Poisson's equation and their adaptability to ILLIAC IV,

Includes bibliography.

Solving triangular systems on a parallel computer /

Includes bibliographical references.

A user's view of solving stiff ordinary differential equations /

"COO-2383-0036."

Krylov subspace methods for solving large unsymmetric linear systems /

"COO-2383-0077"--P. 1 of cover.

An iterative method for solving nonsymmetric linear systems with dynamic estimation of parameters /

Vita.

A method for solving polynomial equations by continued fractions.

Bibliography: p. 16.

An approximation method for solving the sofa problem,

"C00-2118-0026."

Alternative methods for solving the CC-table in Gimpel's algorithm for synthesizing optimal three level NAND networks /

Bibliography: p. 27.