Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
DOI10.1080/01630563.2011.629312zbMath1262.90174OpenAlexW2048792573MaRDI QIDQ2881894
Hsien-Chung Wu, Ching-Feng Wen
Publication date: 3 May 2012
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2011.629312
weak convergenceapproximate solutionsstrong dualityweak dualitycontinuous-time linear fractional programming problems
Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (6)
Cites Work
- Unnamed Item
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- A simplex based algorithm to solve separated continuous linear programs
- On a recurrence algorithm for continuous-time linear fractional programming problems
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Fractional programming: Applications and algorithms
- Optimality conditions and duality in continuous programming. II: The linear problem revisited
- Optimality conditions and strong duality in abstract and continuous-time linear programming
- A class of infinite dimensional linear programming problems
- Continuous time programming with nonlinear constraints
- Saddle-point optimality criteria of continuous time programming without differentiability
- A sufficient optimality criterion in continuous time programming for generalized convex functions
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
- Continuous time programming with nonlinear time-delayed constraints
- An extended algorithm for separated continuous linear programs
- Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
- A class of continuous linear programming problems
- A class of continuous convex programming problems
- Continuous programming. I: Linear objectives
- Continuous programming. II: Nonlinear objectives
- Duality in continuous linear programming
- Continuous time linear-fractional programming. The minimum-risk approach
- Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm
- Some Properties of a Class of Continuous Linear Programs
- Duality for a class of continuous-time homogeneous fractional programming problems
- An Algorithm for a Class of Continuous Linear Programs
- On the Solutions of a Class of Continuous Linear Programs
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- A Duality Theory for Separated Continuous Linear Programs
- Programming with linear fractional functionals
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- An Extended Duality Theorem for Continuous Linear Programming Problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Fractional programming
This page was built for publication: Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems