On the Solutions of a Class of Continuous Linear Programs
From MaRDI portal
Recommendations
Cited in
(29)- On the form of solutions to the linear continuous time programming problem and a conjecture by Tyndall
- On duality and the maximum principle for continuous linear programming problems
- Stochastic separated continuous conic programming: strong duality and a solution method
- Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- A simplex-type algorithm for continuous linear programs with constant coefficients
- On the adjustment problem for linear programs
- Continuous-time multiobjective optimization problems via invexity
- Parametric continuous-time linear fractional programming problems
- Note: continuous-time linear programming problems revisited
- Solving continuous-time linear programming problems based on the piecewise continuous functions
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- scientific article; zbMATH DE number 3845359 (Why is no real title available?)
- scientific article; zbMATH DE number 4162659 (Why is no real title available?)
- Some Properties of a Class of Continuous Linear Programs
- Sur Une Representation Explicite des Solutions Optimales D'un Programme Lineaire
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- Existence and duality theory for separated continuous linear programs
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- Continuous-time linear programming problems revisited: a perturbation approach
- scientific article; zbMATH DE number 1418107 (Why is no real title available?)
- Approximate solutions for continuous-time quadratic fractional programming problems
- Nonsmooth continuous-time optimization problems: Necessary conditions
- On the relationship between the integer and continuous solutions of convex programs
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems
- Continuous-time optimization problems involving invex functions
- Optimal control of a two-server flow-shop network
This page was built for publication: On the Solutions of a Class of Continuous Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308540)