Constraint qualifications in linear vector semi-infinite optimization

Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly 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 global constraint qualifications are illustrated on a collection of selected applications.

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty

The multiobjective optimization model studied in this paper deals with simultaneous minimization of finitely many linear functions subject to an arbitrary number of uncertain linear constraints. We first provide a radius of robust feasibility guaranteeing the feasibility of the robust counterpart under affine data parametrization. We then establish dual characterizations of robust solutions of our model that are immunized against data uncertainty by way of characterizing corresponding solutions of robust counterpart of the model. Consequently, we present robust duality theorems relating the value of the robust model with the corresponding value of its dual problem.

Exact Numerical Processing

Paper submitted to Euromicro Symposium on Digital Systems Design (DSD), Belek-Antalya, Turkey, 2003.

Three-dimensional planar model estimation using multi-constraint knowledge based on k-means and RANSAC

Plane model extraction from three-dimensional point clouds is a necessary step in many different applications such as planar object reconstruction, indoor mapping and indoor localization. Different RANdom SAmple Consensus (RANSAC)-based methods have been proposed for this purpose in recent years. In this study, we propose a novel method-based on RANSAC called Multiplane Model Estimation, which can estimate multiple plane models simultaneously from a noisy point cloud using the knowledge extracted from a scene (or an object) in order to reconstruct it accurately. This method comprises two steps: first, it clusters the data into planar faces that preserve some constraints defined by knowledge related to the object (e.g., the angles between faces); and second, the models of the planes are estimated based on these data using a novel multi-constraint RANSAC. We performed experiments in the clustering and RANSAC stages, which showed that the proposed method performed better than state-of-the-art methods.

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.

The Turkish Empire in Europe, Asia, and Africa: dividid into all its governments, together with the other territories that are tributary to it, as also the dominions of ye Emperor of Marocco [sic] according to the newest and most exact observations

by H. Moll.

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.

Multinomial goodness-of-fit: large sample tests with survey design correction and exact tests for small samples

A new Stata command called -mgof- is introduced. The command is used to compute distributional tests for discrete (categorical, multinomial) variables. Apart from classic large sample $\chi^2$-approximation tests based on Pearson's $X^2$, the likelihood ratio, or any other statistic from the power-divergence family (Cressie and Read 1984), large sample tests for complex survey designs and exact tests for small samples are supported. The complex survey correction is based on the approach by Rao and Scott (1981) and parallels the survey design correction used for independence tests in -svy:tabulate-. The exact tests are computed using Monte Carlo methods or exhaustive enumeration. An exact Kolmogorov-Smirnov test for discrete data is also provided.

An investigation of the exact solutions of the linearized equations for the flow past conical bodies,

Reproduced from type-written copy.

Consular requirements for exporters and shippers to all parts of the world : including exact copies of all forms of consular invoices, with some hints as to drawing out of bills of lading, etc. /

Mode of access: Internet.

Le Pausanias français : état des arts du dessin en France, à l'ouverture du XIXe siecle : Salon de 1806 : ouvrage dans lequel les principales productions de l'école actuelle sont classées, expliquées, analysées, à l'aide d'un commentaire exact, raisonné, et représentées dans une suite de dessins exécutés et gravés par les plus habiles artistes : on y a joint quelques portraits, gravés au trait, de grands artistes vivans, avec des notices historiques et inédites, concernant leur personne et leurs ouvrages /

Barbier, A.A. Ouvrages anonymes,

A complete catalogue of plates published by him, giving titles, prices, exact sizes, and names of the artists and engravers : a facsimile of the only copy known.

Mode of access: Internet.

Future developments in stiff integration techniques : stability of methods that do not use an exact Jacobian /

"COO-2383-0035."