Multiobjective Programming (MOP) has become famous among many researchers due to more practical and realistic applications. A lot of methods have been proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP by starting from a utopian point, which is usually infeasible, and moving towards the feasible region via stepwise mo...

This paper proposes an innovative procedure of finding efficient facility location–allocation (FLA) schemes, integrating data envelopment analysis (DEA) and a multi-objective programming (MOP) model methodology. FLA decisions provide a basic foundation for designing efficient supply chain network in many practical applications. The procedure proposed in this paper would be applied to the FLA pr...

Monitoring-Oriented Programming (MOP) is a formal framework for software development and analysis. It aims at reducing the gap between formal specification and implementation via runtime monitoring. In MOP, the developer specifies desired properties using definable specification formalisms, along with code to execute when properties are violated or validated, which can be used not only to repor...

In this paper, we propose and compare singleand multi-objective programming (MOP) approaches to the language model (LM) adaptation that require the optimization of a number of competing objectives. In LM adaptation, an adapted LM is found so that it is as close as possible to two independently trained LMs. The LM adaptation approach developed in this paper is based on reformulating the training...

This note is motivated by the similarity between multiobjective programming (MOP) and bargaining theory. It uses the known MOP concepts to establish two new bargaining results: (1) the efficiency of KalaiSmorodinsky (KS) and Nash (NA) solutions for large classes of bargaining problems can be refined to the sharper concept of proper efficiency; (2) the independence of irrelevant alternatives (II...

Planning of sewer systems typically involves limitations and problems, regardless whether traditional planning methods or optimization models are used. Such problems include non-quantifiability, fuzzy objectives, uncertainties in decision-making variables which commonly applied the any process. Particularly, have prevented inclusion these models. Consequently, theoretical optional solution math...

A formal framework for software development and analysis is presented, which aims at reducing the gap between formal specification and implementation by integrating the two and allowing them together to form a system. It is called monitoring-oriented programming (MOP), since runtime monitoring is supported and encouraged as a fundamental principle. Monitors are automatically synthesized from fo...

Monitoring-oriented programming (MOP) is a software development and analysis technique in which monitoring plays a fundamental role. MOP users can add their favorite or domain-specific requirements specification formalisms into the framework by means of logic plug-ins, which essentially comprise monitor synthesis algorithms for properties expressed as formulae. The properties are specified toge...

In this paper, a modified TOPSIS (techniques for order preference by similarity to ideal solution) approach for solving bi-level multi-objective programming (BL-MOP) problems with fuzzy parameters is presented. These fuzzy parameters are assumed to be characterized by fuzzy numerical data, reflecting the experts' imprecise or fuzzy understanding of the nature of the parameters in the problem fo...

a theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.in this short note it is shown that the relationship does not exist underall circumstances. the necessary correction is proposed.