scholarly journals Wolfe Type Second Order Nondifferentiable Symmetric Duality in Multiobjective Programming over Cone with Generalized (K, F)-Convexity

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
A. K. Tripathy
Keyword(s):  
Multiobjective Programming ◽  
Second Order ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Symmetric Duality ◽  
New Class ◽  
Duality Results ◽  
Pseudoconvex Function ◽  
Root Term ◽  
Mixed Integer Programming Problem

A new class of second order (K, F) pseudoconvex function is introduced with example. A pair of Wolfe type second order nondifferentiable symmetric dual programs over arbitrary cones with square root term is formulated. The duality results are established under second order (K, F) pseudoconvexity assumption. Also a Wolfe type second order minimax mixed integer programming problem is formulated and the symmetric duality results are established under second order (K, F) pseudoconvexity assumption.

scholarly journals Mond-Weir type second order multiobjective mixed symmetric duality with square root term under generalized univex function

2013 ◽  
Vol 4 (1) ◽  
pp. 21-33
Author(s):  
Arun Kumar Tripathy
Keyword(s):  
Second Order ◽  
Nondifferentiable Programming ◽  
Square Root ◽  
Symmetric Duality ◽  
New Class ◽  
Duality Results ◽  
Special Cases ◽  
Mild Assumption ◽  
Root Term

In this paper, a new class of second order (Φ,ρ)-univex and second order (Φ,ρ)-pseudo univex function are introduced with example. A pair Mond-Weir type second order mixed symmetric duality for multiobjective nondifferentiable programming is formulated and the duality results are established under the mild assumption of second order (∅,ρ) univexity and second order pseudo univexity. Special cases are discussed to show that this study extends some of the known results in related domain..

Symmetric duality results for second-order nondifferentiable multiobjective programming problem

2019 ◽  
Vol 53 (2) ◽  
pp. 539-558 ◽  
Author(s):  
Ramu Dubey ◽  
Vishnu Narayan Mishra
Keyword(s):  
Programming Problem ◽  
Duality Theorem ◽  
Multiobjective Programming ◽  
Second Order ◽  
Weak Duality ◽  
Symmetric Duality ◽  
Numerical Examples ◽  
Duality Results ◽  
Duality Relations ◽  
Multiobjective Programming Problem

In this article, we study the existence of Gf-bonvex/Gf -pseudo-bonvex functions and construct various nontrivial numerical examples for the existence of such type of functions. Furthermore, we formulate Mond-Weir type second-order nondifferentiable multiobjective programming problem and give a nontrivial concrete example which justify weak duality theorem present in the paper. Next, we prove appropriate duality relations under aforesaid assumptions.

Wolfe-type second-order fractional symmetric duality

2014 ◽  
Vol 20 (2) ◽  
Author(s):  
Anurag Jayswal ◽  
Ioan M. Stancu-Minasian ◽  
Ashish K. Prasad
Keyword(s):  
Second Order ◽  
Mixed Integer ◽  
Symmetric Duality ◽  
Duality Results ◽  
Self Duality ◽  
Fractional Programs

AbstractIn the present paper, we examine duality results for Wolfe-type second-order fractional symmetric dual programs. These duality results are then used to investigate minimax mixed integer symmetric dual fractional programs. We also discuss self-duality results at the end.

scholarly journals A Mixed Integer Programming Poultry Feed Ration Optimisation Problem Using the Bat Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Godfrey Chagwiza ◽  
Chipo Chivuraise ◽  
Christopher T. Gadzirayi
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Moringa Oleifera ◽  
Bat Algorithm ◽  
Mixed Integer ◽  
Poultry Feed ◽  
Integer Programming Problem ◽  
Optimum Solution ◽  
Mixed Integer Programming Problem ◽  
Number Of Iterations

In this paper, a feed ration problem is presented as a mixed integer programming problem. An attempt to find the optimal quantities of Moringa oleifera inclusion into the poultry feed ration was done and the problem was solved using the Bat algorithm and the Cplex solver. The study used findings of previous research to investigate the effects of Moringa oleifera inclusion in poultry feed ration. The results show that the farmer is likely to gain US$0.89 more if Moringa oleifera is included in the feed ration. Results also show superiority of the Bat algorithm in terms of execution time and number of iterations required to find the optimum solution as compared with the results obtained by the Cplex solver. Results revealed that there is a significant economic benefit of Moringa oleifera inclusion into the poultry feed ration.

Scheduling of Yard Truck Considering Loading and Unloading Simultaneously in an Underground Container Logistics System

2021 ◽  
pp. 036119812110478
Author(s):  
Yinping Gao ◽  
Daofang Chang ◽  
Jun Yuan ◽  
Chengji Liang
Keyword(s):  
Genetic Algorithm ◽  
Container Terminals ◽  
Mixed Integer ◽  
Operating Efficiency ◽  
Adaptive Genetic Algorithm ◽  
Integer Programming Problem ◽  
Logistics System ◽  
Container Logistics ◽  
Loading And Unloading ◽  
Mixed Integer Programming Problem

With the rapid growth of containers and scarce of land, the underground container logistics system (UCLS) presents a logical alternative for container terminals to better protect the environment and relieve traffic pressure. The operating efficiency of container terminals is one of the competitive edges over other terminals, which requires UCLS to be well integrated with the handling process of the storage yard. In UCLS, yard trucks (YTs) serve different handling points dynamically instead of one fixed handling point, and yard cranes (YCs) perform loading and unloading simultaneously. To minimize the total time of handling all containers in UCLS, the mixed integer programming problem is described and solved using an adaptive genetic algorithm (AGA). The convergence speed and accuracy of AGA are demonstrated by comparison with conventional genetic algorithm (GA). Additionally, AGA and CPLEX are compared with different scale cases. Experimental results show that the proposed algorithm is superior to CPLEX in resulted solutions and calculation time. A sensitivity analysis is provided to obtain reasonable numbers of YTs for scheduling between handling points and the storage yard in UCLS.

The Optimal Controlled Partitioning Strategy for Power System Based on Master-Slave Problem

2013 ◽  
Vol 385-386 ◽  
pp. 999-1006
Author(s):  
Wei Wang ◽  
Ting Yu ◽  
Tian Jiao Pu ◽  
Ai Zhong Tian ◽  
Ji Keng Lin
Keyword(s):  
Large Scale ◽  
Optimization Method ◽  
Mixed Integer ◽  
Master Problem ◽  
Decomposition Algorithms ◽  
Integer Programming Problem ◽  
Complete Model ◽  
New Approach ◽  
Mixed Integer Programming Problem ◽  
Partitioning Strategy

Controlled partitioning strategy is one of the effective measures taken for the situation when system out-of-step occurs. The complete splitting model, mostly solved by approximate decomposition algorithms, is a large-scale nonlinear mixed integer programming problem. A new alternate optimization method based on master-slave problem to search for optimal splitting strategy is proposed hereby. The complete model was converted into master-slave problems based on CGKP (Connected Graph Constrained Knapsack Problem). The coupling between master problem and slave problem is achieved through load adjustment. A better splitting strategy can be obtained through the alternating iteration between the master problem and the salve problem. The results of the examples show that the method can obtain better splitting strategy with less shed load than other approximate algorithms, which verifies the feasibility and effectiveness of the new approach presented.

Sign in / Sign up

Export Citation Format

Share Document