Using the parametric approach to solve the continuous-time linear fractional Max-min problems

DOI10.1007/S10898-011-9751-9zbMATH Open1273.90213OpenAlexW1992368757MaRDI QIDQ445341FDOQ445341

Authors: Ching-Feng Wen, Hsien-Chung Wu 

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

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

zbMATH Keywords

approximate solutionsweak dualitycontinuous-time linear fractional max-min programming problems

Mathematics Subject Classification ID

Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59) Sensitivity, stability, parametric optimization (90C31) Minimax problems in mathematical programming (90C47)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimality conditions and strong duality in abstract and continuous-time linear programming
• A class of infinite dimensional linear programming problems
• Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
• An extended algorithm for separated continuous linear programs
• A class of continuous linear programming problems
• Duality in continuous linear programming
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
• Some Properties of a Class of Continuous Linear Programs
• Duality for a class of continuous-time homogeneous fractional programming problems
• Title not available (Why is that?)
• An Algorithm for a Class of Continuous Linear Programs
• On the Solutions of a Class of Continuous Linear Programs
• Title not available (Why is that?)
• Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
• Forms of Optimal Solutions for Separated Continuous Linear Programs
• Title not available (Why is that?)
• A Duality Theory for Separated Continuous Linear Programs
• 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
• Optimality conditions and duality for a class of nonlinear fractional programming problems.
• A simplex based algorithm to solve separated continuous linear programs
• Title not available (Why is that?)
• Global optimization of fractional programs
• Fractional programming: Applications and algorithms
• Continuous time linear-fractional programming. The minimum-risk approach
• Continuous-time generalized fractional programming
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
• Continuous-time fractional minmax programming
• A recurrence method for a special class of continuous time linear programming problems
• On a recurrence algorithm for continuous-time linear fractional programming problems
• Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
• Fractional programming
• Nonsmooth continuous-time optimization problems: Sufficient conditions
• A class of continuous convex 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
• Optimality conditions and duality in continuous programming. II: The linear problem revisited
• 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
• Continuous time programming with nonlinear time-delayed constraints
• Duality for nonsmooth continuous-time problems of vector optimization
• Continuous programming. I: Linear objectives
• Continuous programming. II: Nonlinear objectives
• Title not available (Why is that?)

Cited In (7)

• 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
• 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
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
• 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)