Using the parametric approach to solve the continuous-time linear fractional Max-min problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3845364
- Parametric continuous-time linear fractional programming problems
- A Parametric Method for Solving the Linear Fractional Programming Problem
- scientific article; zbMATH DE number 4053375
- scientific article; zbMATH DE number 1138285
- A parametric method for solving linear fractional programming problems with flexible constraints
- Solving special nonlinear fractional programming problems via parametric linear programming
- A new linearization technique for minimax linear fractional programming
- A parametric solution method for a generalized fractional programming problem
- Publication:4870399
Cites work
- scientific article; zbMATH DE number 3888314 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4033524 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 866106 (Why is no real title available?)
- scientific article; zbMATH DE number 2196500 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- A Duality Theory for Separated Continuous Linear Programs
- A class of continuous convex programming problems
- A class of continuous linear programming problems
- A class of infinite dimensional linear programming problems
- A recurrence method for a special class of continuous time linear programming problems
- A simplex based algorithm to solve separated continuous linear programs
- A sufficient optimality criterion in continuous time programming for generalized convex functions
- An Algorithm for a Class of Continuous Linear Programs
- An Extended Duality Theorem for Continuous Linear Programming Problems
- An extended algorithm for separated continuous linear programs
- Continuous programming. I: Linear objectives
- Continuous programming. II: Nonlinear objectives
- Continuous time linear-fractional programming. The minimum-risk approach
- Continuous time programming with nonlinear constraints
- Continuous time programming with nonlinear time-delayed constraints
- Continuous-time fractional minmax programming
- Continuous-time generalized fractional programming
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Duality for a class of continuous-time homogeneous fractional programming problems
- Duality for nonsmooth continuous-time problems of vector optimization
- Duality in continuous linear programming
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- Fractional programming
- Fractional programming: Applications and algorithms
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Global optimization of fractional programs
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- On a recurrence algorithm for continuous-time linear fractional programming problems
- On the Solutions of a Class of Continuous Linear Programs
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Optimality conditions and duality in continuous programming. II: The linear problem revisited
- Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
- Optimality conditions and strong duality in abstract and continuous-time linear programming
- Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
- Saddle-point optimality criteria of continuous time programming without differentiability
- Some Properties of a Class of Continuous Linear Programs
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
Cited in
(7)- Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- Multi-objective probabilistic fractional programming problem involving two parameters Cauchy distribution
- A new linearization technique for minimax linear fractional programming
This page was built for publication: Using the parametric approach to solve the continuous-time linear fractional Max-min problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445341)
