✦ LIBER ✦

Multiobjective Programming under Generalized Type I Invexity

✍ Scribed by Morgan A. Hanson; Rita Pini; Chanchal Singh

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 115 KB
Volume: 261
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.2001.7542

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we extend a (scalarized) generalized type-I invexity into a vector invexity (V-type I). A number of sufficiency results are established using Lagrange multiplier conditions and under various types of generalized V-type I requirements. Weak, strong, and converse duality theorems are proved in the generalized V-invexity type I setting.

📜 SIMILAR VOLUMES

Optimality and Duality for Nonsmooth Mul

Optimality and Duality for Nonsmooth Multiobjective Fractional Programming with Generalized Invexity

✍ H. Kuk; G.M. Lee; T. Tanino 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

In this paper, we consider a class of nonsmooth multiobjective fractional programming problems in which functions are locally Lipschitz. We establish generalized Karush-Kuhn-Tucker necessary and sufficient optimality conditions and derive duality theorems for nonsmooth multiobjective fractional prog

Necessary Conditions for Suboptimization

Necessary Conditions for Suboptimization over the Weakly Efficient Set Associated to Generalized Invex Multiobjective Programming

✍ Xu Zengkun 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 157 KB

The problem of optimizing a real-valued function over the weakly efficient set associated to a multiobjective program is examined. Two types of necessary conditions for suboptimizing the solution of the general problem are presented, Ž which are somewhat similar to Theorem 4.1 of S.

Optimality Conditions for Multiobjective

Optimality Conditions for Multiobjective Programming with Generalized (I, ρ, θ)-Convex Set Functions

✍ H.C Lai; J.C Liu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 254 KB

In this paper, we establish some sufficient conditions under which a feasible solution of such a problem will be Pareto optimal provided that a weaker convexity requirement is satisfied; for Ž . instance ᑣ, , -convexity is assumed for both objective and constraint set functions. Some duality models

Exact likelihood inference for the expon

Exact likelihood inference for the exponential distribution under generalized Type-I and Type-II hybrid censoring

✍ B. Chandrasekar; A. Childs; N. Balakrishnan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

## Abstract Chen and Bhattacharyya [Exact confidence bounds for an exponential parameter under hybrid censoring, Commun Statist Theory Methods 17 (1988), 1857–1870] considered a hybrid censoring scheme and obtained the exact distribution of the maximum likelihood estimator of the mean of an exponen