In this paper, we present a nonparametric linear programming estimation method of unique unknown objective function in concave programming with linear inequalities constraint, using sets of constraint condition and corresponding optimal solution data. We also present a linear programming method of maximizing the estimated objective function under new constraint. A case study of simple experimental problem proves the usefulness of our methods. Finally, we show the implications of this paper and problems to be solved in the future
ABSTRACT In this paper, we consider the problem of minimization of an objective function having cont...
This thesis is devoted to algorithms for solving two optimization problems, using linear M-estimatio...
Most inverse optimization models impute unspecified parameters of an objective function to make an o...
AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave ...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
Abstract. In this paper, we develop two algorithms for globally optimizing a special class of linear...
A convex programming algorithm for linear constraints is developed which essentially involves the so...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
We consider a convex maximization problem or equivalently, concave programming. We introduce a gap f...
This paper studies the estimation of fully nonparametric models in which we can not identify the val...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
We consider a linear programming problem, with two parameters in the objective function, and present...
The theory of convex and concave functions is investigated and applied in optimization theory, in pr...
AbstractIn this paper, we propose a novel objective penalty function for inequality constrained opti...
A modification of Snyman's interior feasible direction method for linear programming is proposed and...
ABSTRACT In this paper, we consider the problem of minimization of an objective function having cont...
This thesis is devoted to algorithms for solving two optimization problems, using linear M-estimatio...
Most inverse optimization models impute unspecified parameters of an objective function to make an o...
AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave ...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
Abstract. In this paper, we develop two algorithms for globally optimizing a special class of linear...
A convex programming algorithm for linear constraints is developed which essentially involves the so...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
We consider a convex maximization problem or equivalently, concave programming. We introduce a gap f...
This paper studies the estimation of fully nonparametric models in which we can not identify the val...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
We consider a linear programming problem, with two parameters in the objective function, and present...
The theory of convex and concave functions is investigated and applied in optimization theory, in pr...
AbstractIn this paper, we propose a novel objective penalty function for inequality constrained opti...
A modification of Snyman's interior feasible direction method for linear programming is proposed and...
ABSTRACT In this paper, we consider the problem of minimization of an objective function having cont...
This thesis is devoted to algorithms for solving two optimization problems, using linear M-estimatio...
Most inverse optimization models impute unspecified parameters of an objective function to make an o...