Greedoids and Linear Objective Functions

1984 ◽  
Vol 5 (2) ◽  
pp. 229-238 ◽  
Author(s):  
Bernhard Korte ◽  
László Lovász
Keyword(s):  
Objective Functions ◽  
Linear Objective Functions

scholarly journals Measuring the technical efficiency of local banks in UAE using rough bi-level linear programming technique

2015 ◽  
Vol 1 (1) ◽  
pp. 26
Author(s):  
Doaa Wafik ◽  
O. E. Emam
Keyword(s):  
Decision Making ◽  
Linear Programming ◽  
Technical Efficiency ◽  
Auxiliary Problem ◽  
Optimal Solution ◽  
Objective Functions ◽  
Programming Technique ◽  
Decision Making Problem ◽  
Linear Objective Functions ◽  
Linear Programming Technique

The aim of this paper is to use a bi-level linear programming technique with rough parameters in the constraints, for measuring the technical efficiency of local banks in UAE and Egypt, while the proposed linear objective functions will be maximized for different goals. Based on Dauer's and Krueger's goal programmingmethod, the described approach was developed to deal with the bi-level decision-making problem. The concept of tolerance membership function together was used to generate the optimal solution for the problem under investigation. Also an auxiliary problem is discussed to illustrate the functionality of the proposed approach.

scholarly journals IMPROVING THE AUTOMATIC PROCUREMENT OF WEB SERVICES USING CONSTRAINT PROGRAMMING

2005 ◽  
Vol 14 (04) ◽  
pp. 439-467 ◽  
Author(s):  
ANTONIO RUIZ–CORTÉS ◽  
OCTAVIO MARTÍN–DÍAZ ◽  
AMADOR DURÁN ◽  
M. TORO
Keyword(s):  
Web Services ◽  
Internal Consistency ◽  
Constraint Programming ◽  
Experimental Results ◽  
Objective Functions ◽  
Run Time ◽  
Linear Objective Functions ◽  
Best Offer

Software solutions to automate the procurement of web services are gaining importance when technology evolves, the number of providers increases and the needs of the clients become more complex. There are several proposals in this field, but they all have important drawbacks, namely: many of them are not able to check offers and demands for internal consistency; selecting the best offer usually relies on evaluating linear objective functions, which is quite a naive solution; the language to express offers is usually less expressive than the language to express demands; and, last but not least, providers cannot impose constraints on their clients. In this article, we present a solution to overcome these problems that relies on constraint programming; furthermore, we present a run-time framework, some experimental results, and a comparison with other proposals.

scholarly journals OPTIMASI PENJADWALAN WAKTU KERJA MENGGUNAKAN INTEGER PROGRAMMING

2019 ◽  
Vol 7 (2) ◽  
pp. 51-55
Author(s):  
Windra Tahir ◽  
Djihad Wungguli ◽  
Muhamad Rezky Friesta Payu
Keyword(s):  
Integer Programming ◽  
Optimization Technique ◽  
Linear Constraint ◽  
Crumb Rubber ◽  
Integer Programming Problem ◽  
Scheduling Problems ◽  
Objective Functions ◽  
Integer Variables ◽  
Determining Factors ◽  
Linear Objective Functions

Scheduling workers is one of the problems faced by every company. The regulations set by the company, the availability of the number of workers, and the division of labor are the determining factors in the scheduling system. This worker scheduling problem can be modeled as an Integer Programming problem. Integer Programming is an optimization technique with linear objective functions, linear constraint functions, and integer variables. This paper discusses the formulation of worker scheduling problems in the form of Integer Programming with workers in companies engaged in the production of Crumb Rubber with the objective function of minimizing the number of workers employed. The next model is implemented using the help of LINGO 11.0 software. The implementation results show that the model is able to produce optimal employee schedules.

A Heuristic Approach for Multi Objective Distribution Feeder Reconfiguration

2010 ◽  
Vol 1 (2) ◽  
pp. 60-73 ◽  
Author(s):  
Armin Ebrahimi Milani ◽  
Mahmood Reza Haghifam
Keyword(s):  
Genetic Algorithm ◽  
Fuzzy Set ◽  
Objective Functions ◽  
Suggested Model ◽  
Heuristic Rules ◽  
Multi Objective ◽  
Operation Process ◽  
Distribution Feeder Reconfiguration ◽  
The Status ◽  
Linear Objective Functions

The reconfiguration is an operation process used for optimization with specific objectives by means of changing the status of switches in a distribution network. This paper presents an algorithm for network recon-figuration based on the heuristic rules and fuzzy multi objective approach where each objective is normalized with inspiration from fuzzy set to cause optimization more flexible and formulized as a unique multi objective function. Also, the genetic algorithm is used for solving the suggested model, in which there is no risk of non-linear objective functions and constraints. The effectiveness of the proposed method is demonstrated through several examples in this paper.

scholarly journals Note on combinatorial optimization with max-linear objective functions

1993 ◽  
Vol 42 (2-3) ◽  
pp. 139-145 ◽  
Author(s):  
Sung-Jin Chung ◽  
Horst W. Hamacher ◽  
Francesco Maffioli ◽  
Katta G. Murty
Keyword(s):  
Combinatorial Optimization ◽  
Objective Functions ◽  
Linear Objective Functions
Sign in / Sign up

Export Citation Format

Share Document