Using the parametric approach to solve the continuous-time linear fractional Max-min problems
From MaRDI portal
Publication:445341
DOI10.1007/s10898-011-9751-9zbMath1273.90213OpenAlexW1992368757MaRDI QIDQ445341
Hsien-Chung Wu, Ching-Feng Wen
Publication date: 24 August 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9751-9
Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Continuous-time generalized fractional programming problems. Part I: Basic theory ⋮ A new linearization technique for minimax linear fractional programming ⋮ Continuous-time generalized fractional programming problems. II: an interval-type computational procedure ⋮ MULTI-OBJECTIVE PROBABILISTIC FRACTIONAL PROGRAMMING PROBLEM INVOLVING TWO PARAMETERS CAUCHY DISTRIBUTION ⋮ Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Continuous-time fractional minmax programming
- A simplex based algorithm to solve separated continuous linear programs
- A recurrence method for a special class of continuous time linear programming problems
- 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
- Global optimization of fractional programs
- 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
- Duality for nonsmooth continuous-time problems of vector 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
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Continuous time linear-fractional programming. The minimum-risk approach
- 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
- Continuous-time generalized fractional programming
- 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
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Using the parametric approach to solve the continuous-time linear fractional Max-min problems
