fractional programming - Globe Thesis

Keyword [fractional programming] Result: 21 - 40 \| Page: 2 of 3
21.	Sufficiency And Duality For Generalized Convex Infinite Fractional Programming
22.	Optimality Conditions And Duality For Multiobjective Fractional Programming Problems
23.	Two Kinds Of Nonlinear Programming Problems Of Global Optimization
24.	Approximation Algorithms For Generalized Nonlinear Fractional Programs
25.	Network Model Of Fractional Programming Problems
26.	Parametric Duality Models For Semi-Infinite Fractional Programming Problems Involving Semi-E-Convex Functions
27.	Sufficient Optimality Conditions For Semi-Infinite Fractional Programming Problems Involving Generalized E-Convex Functions
28.	A Branch And Bound Algorithm For Two Classes Of Non-Convex Global Optimization Problems
29.	Optimality And Duality For Certain Generalized Convex Programming Problems
30.	The Optimality And Duality For Multi-objective Fractional Programming Involving Unified (c,a,p,d)_s Convexity
31.	Optimality And Duality For Multi-objective Programming Involving Generalized(F,α,ρ,d)-V-Convexity
32.	Global Polynomial Time Approximation Algorithms For Two Types Of Fractional Programming Problems
33.	Branch-and-Bound Algorithm Of Fractional Programming And Nonconvex Quadratic Programming
34.	Research On The Global Optimization Of Two Types Of Non-convex Programming Problems
35.	The Optimality And Duality For A Class Of Multiobjective Semi-infinite Fractional Programming
36.	Global Optimization Algorithms Of Fractional Programming Problems
37.	The Lagrange Duality Of Fractional Optimization Problem With Composite Function
38.	Solution Methods For Several Kinds Of Fractional Programming Problems
39.	Branch And Bound Algorithms For Two Types Of Fractional Programming Problems
40.	Iterative Algorithm For Generalized Fractional Programming Problems
<<First <Prev Next> Last>> Jump to