The efficiency of object-oriented programs has become a point of great interest. One necessary factor for program efficiency is the optimization techniques involved. This paper presents the performance of several variations of a given C t t program and compares them with a version that uses no objec
Efficiency and Approachability of Nonconvex Bicriteria Programs
โ Scribed by X.X. Huang; X.Q. Yang
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 114 KB
- Volume
- 261
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we investigate equivalences between an efficient solution of a bicriteria program and a lower envelope point of a certain image set of the bicriteria program. We also employ various kinds of approachabilities to characterize efficiency and proper efficiency for nonconvex bicriteria programs. In particular, nonlinear Lagranian functions are applied to construct dual problems and to study stability for the corresponding constrained scalar optimization problems. Under certain conditions we show that the finite approachability, proper efficiency, stability, and exact penalization of the relevant constrained scalar optimization problems are equivalent.
๐ SIMILAR VOLUMES
Computers are broadly classified into two classes: general-purpose and special-purpose. General-purpose computers provide tolerable performance on a wide range of programs. In contrast, specialized computers, tailored to a narrow class of programs, usually yield significantly higher throughput. Howe
The aim of this article is to present a simple encoding technique that can be profitably utilized in program storage. Among the benefits of an editor that utilizes such an encoding is the reduced costs in lexical analy sis stages of software tools, such as language translators and pretty printers. B